MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 332 Mcqs, each offering curated multiple-choice questions to sharpen your Master of Science in Computer Science (M.Sc CS) knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
The normalized turnaround time is |
| A. | Ratio of turnaround time to service time |
| B. | Ratio of turnaround time to waiting time |
| C. | Ratio of service time to waiting time |
| D. | Ratio of waiting time to service time. |
| Answer» B. Ratio of turnaround time to waiting time | |
| 52. |
The principal function of a process is |
| A. | To execute machine instructions residing in main memory. |
| B. | To execute assembly instructions residing outside main memory. |
| C. | A and B both true. |
| D. | A and B both false. |
| Answer» B. To execute assembly instructions residing outside main memory. | |
| 53. |
The UNIX, an operating system supports |
| A. | Multiple user processes and single thread per process. |
| B. | Multiple user processes and multiple threads per process. |
| C. | Single user process and single thread per process. |
| D. | Single user process and multiple threads per process. |
| Answer» D. Single user process and multiple threads per process. | |
| 54. |
An unpaged cache associates disk domains with the address of the read and continues for a specific length. The major disadvantage of unpaged cache is that |
| A. | it allows cache domain to contain redundant data |
| B. | it does not allow writes to be cached |
| C. | its access time is greater than that of paged caching |
| D. | read ahead cache domain blocks are necessarily fixed in size |
| Answer» B. it does not allow writes to be cached | |
| 55. |
Memory buffer register (MBR) contains |
| A. | Data that is to be written into memory |
| B. | A particular I/O device. |
| C. | Exchange data between I/O module and the processor. |
| D. | The instruction most recently fetched. |
| Answer» B. A particular I/O device. | |
| 56. |
I/O redirection |
| A. | implies changing the name of a file |
| B. | can be employed to use an exiting file as input file for a program |
| C. | implies connection to programs through a pipe |
| D. | none of the above |
| Answer» C. implies connection to programs through a pipe | |
| 57. |
The amount of memory (in bytes) required for a block bitmap is |
| A. | Disk size × 8 |
| B. | Disk size/ (8 × file system block size) |
| C. | File system block size/disk size |
| D. | None of these. |
| Answer» C. File system block size/disk size | |
| 58. |
An attached processor |
| A. | is used one only a few computers |
| B. | causes all processor to function equally |
| C. | is more difficult to implement than a co- processor |
| D. | is used only for limited, specific functions |
| Answer» E. | |
| 59. |
The only state transition initiated by the user process itself in an operating system is |
| A. | Block |
| B. | Timer run out |
| C. | Dispatch |
| D. | Wake up |
| Answer» B. Timer run out | |
| 60. |
I/O tables are used |
| A. | To assign I/O devices of computer |
| B. | To manage I/O devices of computer system |
| C. | A and B both true |
| D. | A and B both false. |
| Answer» D. A and B both false. | |
| 61. |
User-visible register |
| A. | Enables machine language programmer to minimize main memory reference by optimizing register use. |
| B. | Enables assembly language programmer to minimize main memory reference by optimizing register use. |
| C. | A and B both true. |
| D. | A and B both false. |
| Answer» D. A and B both false. | |
| 62. |
Windows is an |
| A. | operating system |
| B. | operating environment |
| C. | user interface |
| D. | programming platform |
| Answer» D. programming platform | |
| 63. |
The UNIX scheduling gives |
| A. | Highest preference to real time processes |
| B. | Highest preference to kernel mode processes |
| C. | Highest preference to user mode processes |
| D. | Highest preference to shared processes. |
| Answer» B. Highest preference to kernel mode processes | |
| 64. |
The following operating system writes through catches? |
| A. | UNIX |
| B. | DOS |
| C. | ULTRIX |
| D. | XENIX |
| Answer» C. ULTRIX | |
| 65. |
In shortest service time first policy, applied on disk scheduling, the disk request is selected |
| A. | That requires the least movement of disk arm from its current position. |
| B. | That requires the maximum movement of disk arm from its current position. |
| C. | That is recently receiv |
| Answer» B. That requires the maximum movement of disk arm from its current position. | |
| 66. |
Match the following for file system architecture : A-Basic file system, B-Logical I/O module, 1- Deals with blocks of data, 2- Deals with file records, 3- Provides general purpose record I/O capacity. |
| A. | A – 1, B – 2, 3 |
| B. | A – 1, 2, B – 3 |
| C. | A – 2, 3, B – 1 |
| D. | A – 1, 3, B – 2 |
| Answer» B. A – 1, 2, B – 3 | |
| 67. |
Application Programming Interface is |
| A. | A set of function and call programs that allows clients and servers to intercommunicate. |
| B. | A database, where information access is limited to the selection of rows that satisfy all search criteria. |
| C. | A computer usually a high powered work station. |
| D. | None of these. |
| Answer» B. A database, where information access is limited to the selection of rows that satisfy all search criteria. | |
| 68. |
Multiprocessing models have |
| A. | symmetric multiprocessing model |
| B. | asymmetric multiprocessing model |
| C. | both (A) and (B) above |
| D. | None of these |
| Answer» D. None of these | |
| 69. |
82. In real time computing |
| A. | The result of computation does not depend on the time at which computa- tion is done. |
| B. | The result of computation also depends on the time at which computation is done. |
| C. | The results are independent of the time consider |
| Answer» B. The result of computation also depends on the time at which computation is done. | |
| 70. |
Banker’s algorithm for resource allocation deals with |
| A. | deadlock prevention |
| B. | deadlock avoidance |
| C. | deadlock recovery |
| D. | mutual exclusion |
| Answer» C. deadlock recovery | |
| 71. |
In bit table used for Free space management in secondary storage |
| A. | Bit zero corresponds to free block |
| B. | Bit one corresponds to free block |
| C. | Bit zero corresponds to block in use |
| D. | None of these |
| Answer» B. Bit one corresponds to free block | |
| 72. |
The two state process models have the following states |
| A. | Running and Not Running |
| B. | Running and Ready |
| C. | Ready and Blocked |
| D. | New and Ready. |
| Answer» B. Running and Ready | |
| 73. |
In multi processor scheduling, independent parallelism indicates |
| A. | There is synchronization among processes at gross level. |
| B. | There is no explicit synchronization among processes. |
| C. | A parallel processing or multi tasking is done within a single application. |
| D. | None of these. |
| Answer» C. A parallel processing or multi tasking is done within a single application. | |
| 74. |
Match the following in RAID scheme : A- Parallel access array, B-Independent access array, 1- All member disks participate in the execution of every I/O request. 2- Each member disk participates separately in the execution of every I/O request. 3- Here spindles of the individual drives are synchronized so that each disk head is in the same position on each disk at any given time. |
| A. | A – 1, 3 and B – 2 |
| B. | A – 1, and B – 2, 3 |
| C. | A – 2 and B – 1, 3 |
| D. | A – 1, 2 and B – 3 |
| Answer» B. A – 1, and B – 2, 3 | |
| 75. |
A. Absolute Loading B. Relocatable LoadingC. Dynamic Run-Time Loading; 1- It requires that a load module always be loaded into some location in main memory. 2- A load module can be located anywhere in main memory. |
| A. | A – 2, B – 1, C – 1 |
| B. | A – 1, B – 1, C – 2 |
| C. | A – 1, B – 2, C – 2 |
| D. | A – 1, B – 2, C – 1 |
| Answer» D. A – 1, B – 2, C – 1 | |
| 76. |
The mail box and ports are examples of |
| A. | Indirect process communication |
| B. | Direct process communication. |
| C. | Both A and B true |
| D. | None is true |
| Answer» B. Direct process communication. | |
| 77. |
The direct memory access (DM(A) module |
| A. | Controls the data exchange between main memory and I/O module. |
| B. | The processor issues I/O command, execute subsequent instructions and interrupt I/O module. |
| C. | The processor issues I/O commands to an I/O module. |
| D. | None of these. |
| Answer» B. The processor issues I/O command, execute subsequent instructions and interrupt I/O module. | |
| 78. |
In Layered operating system following statement is false |
| A. | Most or all the layers execute in kernel mode. |
| B. | Interaction only takes place between adjacent layers. |
| C. | Functions are organized hierarchically. |
| D. | None of these. |
| Answer» E. | |
| 79. |
Following is not the state of Five-State process model |
| A. | Ready |
| B. | Running |
| C. | Not Running |
| D. | New. |
| Answer» D. New. | |
| 80. |
In shared memory multi processor |
| A. | Computer communicate to each other by fixed paths |
| B. | Computer communicates to each other via a shared memory. |
| C. | Each processing element is a self contained computer. |
| D. | None of these. |
| Answer» C. Each processing element is a self contained computer. | |
| 81. |
In semaphore, the process executing the wait is blocked if |
| A. | The semaphore value becomes negative |
| B. | The semaphore value become positive |
| C. | The semaphore value becomes non-positive |
| D. | The semaphore value becomes non- negative. |
| Answer» B. The semaphore value become positive | |
| 82. |
In Dynamic partition of main memory in memory management, the sized of process and memory partition is |
| A. | of exactly same size |
| B. | of different size. |
| C. | Both A and B true |
| D. | None is true |
| Answer» B. of different size. | |
| 83. |
In defining page table structure in virtual memory, A page number portion of a virtual address is mapped into a hash table using simple hash function, where hash table contains a pointer to the inverted page table, which contains page table entries, this approach is referred as |
| A. | One page table per process structure. |
| B. | Two level page table structure. |
| C. | Inverted page table structure. |
| D. | None of these. |
| Answer» D. None of these. | |
| 84. |
Which of the following is not an address register? |
| A. | Index register |
| B. | Segment pointer |
| C. | Stack pointer |
| D. | Data register. |
| Answer» E. | |
| 85. |
In multi processor scheduling; A: Coarse gained parallelism, B: Medium grained parallelism, C: Fine grained parallelism; 1- Concurrent processes running on a multi programmed uni processor, 2 Parallel processing or multi tasking is done within a single application, 3-Parallel processing is done within a single instruction stream. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 2, B – 3, C – 1 |
| C. | A – 3, B – 2, C – 1 |
| D. | A – 1, B – 3, C – 2 |
| Answer» B. A – 2, B – 3, C – 1 | |
| 86. |
The deterministic operating system |
| A. | Where operations are performed with in pre-determined time interval. |
| B. | Where operations can be performed with out pre-determined time interval. |
| C. | The operating time can not be determin |
| Answer» B. Where operations can be performed with out pre-determined time interval. | |
| 87. |
Memory table is used |
| A. | To allocate main memory to processes |
| B. | To allocate secondary memory to processes |
| C. | To manage virtual memory |
| D. | A, B and C are true. |
| Answer» E. | |
| 88. |
Which types of file organization aresupported by magnetic tape? |
| A. | random files |
| B. | contiguous sequential file |
| C. | indexed sequential file |
| D. | all of the above |
| Answer» C. indexed sequential file | |
| 89. |
The disk and tape devices are referred as |
| A. | Block oriented I/O devices |
| B. | Stream oriented I/O devices |
| C. | Logical I/O devices |
| D. | None of these |
| Answer» B. Stream oriented I/O devices | |
| 90. |
In virtual memory management, when local control policy is applied |
| A. | It determines the number of processes that are to be resident in main memory. |
| B. | It determines the number of processes that are to be resident in virtual memory. |
| C. | It determines when a modified page should be written out to secondary memory. |
| D. | None of these. |
| Answer» B. It determines the number of processes that are to be resident in virtual memory. | |
| 91. |
Arrange the following I/O device in increasing data rate Hard disk, Floppy disk, Key board |
| A. | Key board, Floppy disk, Hard disk |
| B. | Floppy disk, Key board, Hard disk |
| C. | Key board, Hard disk, Floppy disk |
| D. | Hard disk, Floppy disk, Key board. |
| Answer» B. Floppy disk, Key board, Hard disk | |
| 92. |
In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time. |
| A. | A – 1, B – 2, C – 3 |
| B. | A – 2, B – 3, C – 1 |
| C. | A – 3, B – 1, C – 2 |
| D. | None of these. |
| Answer» B. A – 2, B – 3, C – 1 | |
| 93. |
If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects. |
| A. | The ready process with lowest normalized turnaround time. |
| B. | The ready process with highest normalized turnaround time. |
| C. | The process with shortest expected processing time. |
| D. | The process with highest expected processing time. |
| Answer» C. The process with shortest expected processing time. | |
| 94. |
The allocation map |
| A. | is used to store program data |
| B. | specifies which blocks are used by which file |
| C. | is updated by applications programs |
| D. | allows programs to erase files |
| Answer» C. is updated by applications programs | |
| 95. |
In process management of UNIX system, which of the following process states are running states in respect of whether the process is executing in user or kernel mode |
| A. | Ready to run (in memory) state |
| B. | Ready to run (in swappe(D) state |
| C. | Preempted state |
| D. | A and C are true |
| Answer» E. | |
| 96. |
Dijkstra’s banker’s algorithm in an operating-system solves the problem of |
| A. | deadlock avoidance |
| B. | deadlock recovery |
| C. | mutual exclusion |
| D. | context switching |
| Answer» B. deadlock recovery | |
| 97. |
I/O OBR (I/O Buffer register) is |
| A. | Used for the exchange of data between an I/O module and the processor. |
| B. | Specifies particular I/O device. |
| C. | (A) and (B) both true. |
| D. | (A) and (B) both false. |
| Answer» B. Specifies particular I/O device. | |
| 98. |
Check pointing a job |
| A. | allows it to be completed successfully |
| B. | allows it to continue executing later |
| C. | prepares it for finishing |
| D. | occurs only when there is an error in it |
| Answer» C. prepares it for finishing | |
| 99. |
Of the following which is the methods for allocating disks |
| A. | Contiguous |
| B. | Linked |
| C. | Indexed |
| D. | All of the above |
| Answer» C. Indexed | |
| 100. |
A situation where two or more processes coordinate their activities based on a condition is referred as |
| A. | Synchronization |
| B. | Dead lock |
| C. | Starvation |
| D. | Par begin |
| Answer» B. Dead lock | |