Skip to main content

Operating System MCQs with Answers

Practice important Operating System MCQs with answers and explanations.

Multiple Choice Questions

Q391: The SRTF algorithm is a preemptive version of __________.
  • A: Round Robin
  • B: Shortest-Job-First
  • C: Priority Scheduling
  • D: FCFS
View Answer
B

Q392: Aging in priority scheduling involves __________ the priority of long-waiting processes to prevent starvation.
  • A: decreasing
  • B: increasing
  • C: resetting
  • D: locking
View Answer
B

Q393: Fill in the blank: In SJF, when a process is ready to execute, it is chosen based on its __________.
  • A: CPU burst length
  • B: arrival time
  • C: priority
  • D: resource usage
View Answer
A

Q394: Fill in the blank: The SRTF scheduling algorithm is also called __________ scheduling.
  • A: Shortest Remaining Time First
  • B: Longest Remaining Time First
  • C: First Come First Serve
  • D: Priority Scheduling
View Answer
A

Q395: In Priority Scheduling, which process has the highest priority?
  • A: The one with the largest priority number
  • B: The one with the smallest priority number
  • C: The one with the largest burst time
  • D: The one with the smallest burst time
View Answer
B

Q396: Which algorithm is considered optimal in minimizing wait times for short processes?
  • A: Longest Job First (LJF)
  • B: Shortest Job First (SJF)
  • C: Round Robin (RR)
  • D: First Come First Serve (FCFS)
View Answer
B

Q397: In the shortest job first (SJF) scheduling algorithm, the waiting time for which process decreases significantly compared to other processes?
  • A: P1
  • B: P2
  • C: P3
  • D: P4
View Answer
B

Q398: What does the round-robin scheduling algorithm use to determine how long a process gets the CPU?
  • A: Time quantum
  • B: Arrival time
  • C: Processing time
  • D: Waiting time
View Answer
A

Q399: In round-robin scheduling, what happens if the CPU burst of a process is longer than the time quantum?
  • A: The process will continue without interruption
  • B: The process will be preempted and placed at the end of the queue
  • C: The process will be terminated
  • D: The process will be suspended until the next cycle
View Answer
B

Q400: Which of the following is true about Round Robin scheduling?
  • A: It is non-preemptive
  • B: It is ideal for batch processing
  • C: It minimizes turnaround time in time-sharing systems
  • D: It uses fixed priorities
View Answer
C

Test Your Knowledge

Take a timed quiz on Operating System

🚀 Start Quiz Now