Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q371: Which of the following is a feature of preemptive scheduling?
- A: The CPU can be reallocated before the process finishes its burst time.
- B: The process executes until termination without interruption.
- C: The process must wait for I/O before the CPU is allocated.
- D: None of the above
View Answer
A
Q372: Which of the following scheduling algorithms is best for batch systems?
- A: FCFS
- B: SJF
- C: Multilevel queues
- D: All of the above
View Answer
A
Q373: In a non-preemptive system, once the CPU is allocated to a process, it will keep the CPU until _______.
- A: The process completes execution
- B: The process terminates
- C: The process switches to waiting state
- D: The process switches to ready state
View Answer
C
Q374: What happens when the CPU becomes idle in a multiprogramming system?
- A: The OS selects a new process to execute.
- B: The system enters a shutdown state.
- C: The running process is terminated.
- D: No action is taken.
View Answer
A
Q375: Fill in the blank: A process that requests the CPU first is allocated the CPU first in the _______ scheduling algorithm.
- A: First-Come-First-Served (FCFS)
- B: Shortest Job First (SJF)
- C: Shortest Remaining Time First (SRTF)
- D: Priority Scheduling
View Answer
A
Q376: Fill in the blank: In FCFS scheduling, the average waiting time can vary substantially if the processes' _______ vary greatly.
- A: Memory requirements
- B: Burst times
- C: I/O times
- D: Priority levels
View Answer
B
Q377: The Shortest-Job-First (SJF) scheduling algorithm assigns the CPU to the process with the __________ next CPU burst.
- A: longest
- B: shortest
- C: average
- D: equal
View Answer
B
Q378: In Shortest-Job-First (SJF) scheduling, if two processes have the same CPU burst, which scheduling is used to break the tie?
- A: Round Robin
- B: Priority Scheduling
- C: FCFS
- D: SRTF
View Answer
C
Q379: The predicted value for the next CPU burst in SJF is given by the equation τn+1 = αtn + (1-α)τn, where 0 ≤ α ≤ 1. What does α represent?
- A: Time unit
- B: Process priority
- C: Smoothing constant
- D: CPU burst
View Answer
C
Q380: Shortest-Job-First scheduling is a __________ algorithm.
- A: preemptive
- B: non-preemptive
- C: hybrid
- D: both
View Answer
B