Skip to main content

Operating System MCQs with Answers

Practice important Operating System MCQs with answers and explanations.

Multiple Choice Questions

🚀 Start Quiz
Q381: The average waiting time for the given process set (P1: 7, P2: 4, P3: 1, P4: 4) using SJF is __________ time units.
  • A: 5
  • B: 4
  • C: 3
  • D: 2
View Answer
B

Q382: In the SRTF scheduling algorithm, if a new process arrives with a shorter next CPU burst than the currently executing process, what happens?
  • A: The current process is allowed to continue
  • B: The current process is preempted
  • C: The new process is ignored
  • D: The system shuts down
View Answer
B

Q383: What is the main difficulty with implementing Shortest-Job-First (SJF) scheduling in a system?
  • A: Predicting the next CPU burst
  • B: Allocating CPU time
  • C: Preempting processes
  • D: Handling I/O requests
View Answer
A

Q384: Priority scheduling assigns the CPU to the process with the __________ priority.
  • A: highest
  • B: lowest
  • C: random
  • D: longest
View Answer
A

Q385: Aging in priority scheduling is used to prevent __________.
  • A: starvation
  • B: preemption
  • C: CPU bursts
  • D: context switching
View Answer
A

Q386: In Priority Scheduling, if two processes have the same priority, which scheduling is used?
  • A: Round Robin
  • B: FCFS
  • C: SJF
  • D: SRTF
View Answer
B

Q387: A process may experience indefinite blocking in __________ scheduling.
  • A: Shortest-Job-First (SJF)
  • B: Priority Scheduling
  • C: Round Robin
  • D: FCFS
View Answer
B

Q388: In Priority Scheduling, if the new process has a higher priority than the currently running process, the CPU is __________.
  • A: preempted
  • B: not preempted
  • C: given to the process with the lowest priority
  • D: blocked
View Answer
A

Q389: The SJF algorithm can be used in both __________ and __________ versions.
  • A: preemptive, non-preemptive
  • B: FIFO, LIFO
  • C: static, dynamic
  • D: permanent, temporary
View Answer
A

Q390: Fill in the blank: In the SJF scheduling algorithm, the predicted value for the next CPU burst (τn+1) is a weighted average of __________ and __________.
  • A: current CPU burst, past CPU burst
  • B: last CPU burst, priority
  • C: CPU burst, priority
  • D: arrival time, burst time
View Answer
A

Test Your Knowledge

Take a timed quiz on Operating System

🚀 Start Quiz Now