Basic Operating System MCQ
Basic Operating System MCQ
81. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
- Time-sharing
- SPOOLing
- Preemptive scheduling
- Multiprogramming
82. _________ allocates the largest hole (free fragmant) available in the memory.
- Best Fit
- Worst Fit
- First Fit
- None of the above
83. A process is starved
- if it is permanently waiting for a resource
- if semaphores are not used
- if a queue is not used for scheduling
- if demand paging is not properly implemented
84. The degree of Multiprogramming is controlled by
- CPU Scheduler
- Context Switching
- Long-term Scheduler
- Medium term Scheduler
85. The time taken to bring the desired track/cylinder under the head is _________.
- Seek time
- Latency time
- Transfer time
- Read time
86. Replace the page that will not be used for the longest period of time. This principle is adopted by ____________.
- FIFO Page replacement algorithm
- Optimal Page replacement algorithm
- Round robin scheduling algorithm
- SCAN scheduling algorithm
87. Which of the following is a criterion to evaluate a scheduling algorithm?
- CPU Utilization: Keep CPU utilization as high as possible.
- Throughput: number of processes completed per unit time.
- Waiting Time: Amount of time spent ready to run but not running.
- All of the above
88. The operating system of a computer serves as a software interface between the user and the ________.
- Hardware
- Peripheral
- Memory
- Screen
89. Super computers typically employ _______.
- Real time Operating system
- Multiprocessors OS
- desktop OS
- None of the above
90. A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication, is called ________.
- Local Procedure Call
- Inter Process Communication
- Remote Procedure Call
- Remote Machine Invocation