Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q431: The formula for Little's law in queuing theory is __________.
- A: n = λ * W
- B: W = n * λ
- C: λ = W * n
- D: n = W + λ
View Answer
A
Q432: In the UNIX System V scheduling algorithm, which group has the highest priority?
- A: Kernel Group
- B: User Group
- C: Both Kernel and User groups have equal priority
- D: None of the above
View Answer
A
Q433: The method used to upgrade a process to a higher priority queue in Multilevel Feedback Queue Scheduling is called __________.
- A: Aging
- B: Decay
- C: Recalculation
- D: Rebalancing
View Answer
A
Q434: In a multi-level feedback queue scheduling system, which of the following characteristics is true?
- A: I/O bound processes stay in higher-priority queues
- B: Processes with longer CPU bursts are moved to higher-priority queues
- C: Aging increases the CPU burst time
- D: All processes are treated equally
View Answer
A
Q435: When a process in the UNIX System V scheduler is demoted, it is __________.
- A: Moved to a lower priority queue
- B: Given higher priority
- C: Put into the Kernel Group
- D: Recalculated for the User Group
View Answer
A
Q436: In scheduling algorithm evaluation, queuing models primarily focus on analyzing __________.
- A: Queue length, waiting time, and arrival rate
- B: CPU burst time and system memory
- C: Process aging and priority scheduling
- D: Process termination and CPU time
View Answer
A
Q437: A simulation used for evaluating scheduling algorithms might include which of the following issues?
- A: Programming cost and execution time
- B: Accurate real-time data collection
- C: Simple modeling without assumptions
- D: None of the above
View Answer
A
Q438: The priority number in UNIX System V scheduling is updated every __________.
- A: Second
- B: Millisecond
- C: Tenth of a second
- D: Every minute
View Answer
A
Q439: Which of the following statements is true regarding UNIX System V scheduling for user processes?
- A: CPU-bound processes are penalized at the expense of I/O-bound processes
- B: I/O-bound processes are penalized at the expense of CPU-bound processes
- C: Both types of processes are treated equally
- D: The scheduling does not consider process type
View Answer
A
Q440: The primary disadvantage of using simulations for algorithm evaluation is __________.
- A: High programming and execution costs
- B: Inaccurate real-world results
- C: Limited accuracy due to queuing analysis assumptions
- D: Insufficient data on workload characteristics
View Answer
A