Practice Operating System Scheduling MCQ questions with answers and explanations. These OS scheduling MCQs cover CPU scheduling algorithms, process states, turnaround time, waiting time, and scheduling concepts. Useful for IBPS IT Officer, GATE, and other competitive exams.
Difficulty: Easy to Medium
Total Questions: 12
Operating System Scheduling MCQs
Q1. CPU scheduling is used to:
A. Manage memory
B. Allocate CPU to processes
C. Manage files
D. Handle interrupts
View Answer & Explanation
Answer: B
Explanation: CPU scheduling determines which process gets CPU time among multiple ready processes.
Q2. Which of the following is a preemptive scheduling algorithm?
A. FCFS
B. SJF (Non-preemptive)
C. Round Robin
D. Priority Scheduling (Non-preemptive)
View Answer & Explanation
Answer: C
Explanation: Round Robin uses time slicing and can interrupt running processes.
Q3. A process moves from Blocked state to which state after I/O completion?
A. Running
B. Ready
C. Terminated
D. Waiting
View Answer & Explanation
Answer: B
Explanation: After I/O completion, the process moves to Ready state.
Q4. A process is defined as:
A. Program stored in disk
B. Program in execution
C. Compiled code
D. Executable file
View Answer & Explanation
Answer: B
Explanation: A process is an active instance of a program.
Q5. Turnaround time is defined as:
A. Execution time only
B. Waiting time only
C. Submission to completion time
D. CPU burst time
View Answer & Explanation
Answer: C
Explanation: Turnaround time includes total time from submission to completion.
Q6. Waiting time is:
A. Time in CPU
B. Time in ready queue
C. Execution time
D. I/O time
View Answer & Explanation
Answer: B
Explanation: Waiting time is time spent in the ready queue.
Q7. FCFS scheduling stands for:
A. First Come First Serve
B. First CPU First Serve
C. Fast Come Fast Serve
D. None
View Answer & Explanation
Answer: A
Explanation: FCFS executes processes in arrival order.
Q8. Which scheduling algorithm may cause starvation?
A. Round Robin
B. FCFS
C. Priority Scheduling
D. FIFO
View Answer & Explanation
Answer: C
Explanation: Low priority processes may never execute.
Q9. Time quantum is used in:
A. FCFS
B. Round Robin
C. SJF
D. Priority Scheduling
View Answer & Explanation
Answer: B
Explanation: Round Robin uses time slices.
Q10. Preemptive scheduling allows:
A. Only one process execution
B. Interrupting running processes
C. Sequential execution
D. No interruptions
View Answer & Explanation
Answer: B
Explanation: OS can interrupt processes for fairness.
Q11. Shortest Job First scheduling selects process based on:
A. Arrival time
B. Priority
C. CPU burst time
D. Waiting time
View Answer & Explanation
Answer: C
Explanation: SJF picks the smallest execution time.
Q12. The main goal of scheduling is to:
A. Maximize CPU utilization
B. Increase waiting time
C. Reduce throughput
D. Increase idle time
View Answer & Explanation
Answer: A
Explanation: Scheduling improves system efficiency.
Q13. In Round Robin scheduling, if the time quantum is too large, it behaves like:
A. Shortest Job First
B. First Come First Serve
C. Priority Scheduling
D. Multilevel Queue
View Answer & Explanation
Answer: B
Explanation: If the time quantum is very large, processes are rarely preempted, making Round Robin behave like FCFS.
Q14. Which scheduling algorithm gives the minimum average waiting time but may cause starvation?
A. First Come First Serve
B. Round Robin
C. Shortest Job First
D. Priority Scheduling
View Answer & Explanation
Answer: C
Explanation: SJF minimizes average waiting time but can starve longer processes if shorter jobs keep arriving.
Q15. In a preemptive priority scheduling system, a lower-priority process is holding a resource needed by a higher-priority process. What is this situation called?
A. Starvation
B. Deadlock
C. Priority Inversion
D. Context Switching
View Answer & Explanation
Answer: C
Explanation: Priority inversion occurs when a lower-priority process holds a resource required by a higher-priority process, causing the higher-priority process to wait. This is typically solved using priority inheritance.
Conclusion
These Operating System Scheduling MCQ questions help strengthen your understanding of scheduling algorithms and process management concepts. Practice regularly for IBPS and GATE exams.
For detailed theory and understanding of the concept, refer to CPU Scheduling in Operating Systems.