Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 16
Q421:
Multilevel Queue Scheduling ensures that:
A. All processes are treated equally
B. Processes are classified based on priority and type
C. Background processes are never executed
D. Foreground processes can be preempted
Correct Answer:
B
Chapter: 16
Q422:
Fill in the blank: In the Round Robin scheduling algorithm, when a process finishes its time quantum, it is moved to the _______ of the ready queue.
A. end
B. start
C. middle
D. same position
Correct Answer:
A
Chapter: 17
Q423:
What does Multilevel Feedback Queue Scheduling aim to prevent?
A. Starvation
B. Process deadlock
C. CPU overload
D. Process starvation in all processes
Correct Answer:
A
Chapter: 17
Q424:
In UNIX System V scheduling, the priority of processes in the Kernel Group remains __________.
A. Dynamic
B. Fixed
C. Variable
D. Recalculated every second
Correct Answer:
B
Chapter: 17
Q425:
Which of the following is a feature of the UNIX System V scheduling algorithm?
A. Round Robin within each queue
B. Priorities are not updated
C. FIFO within all queues
D. No CPU-bound penalty
Correct Answer:
A
Chapter: 17
Q426:
The decay function in UNIX System V scheduling helps to __________.
A. Increase priority for CPU-bound processes
B. Decrease priority for I/O-bound processes
C. Penalize CPU-bound processes
D. Prevent process starvation
Correct Answer:
B
Chapter: 17
Q427:
Multilevel Feedback Queue Scheduling is defined by which of the following parameters?
A. Number of queues, scheduling algorithm for each queue, and method of process promotion
B. Number of CPUs, priority scheduling, and aging process
C. Scheduling type and queue priority
D. None of the above
Correct Answer:
A
Chapter: 17
Q428:
UNIX System V scheduling algorithm operates with a quantum of __________.
A. 2 seconds
B. 1 second
C. 5 seconds
D. Variable based on process type
Correct Answer:
B
Chapter: 17
Q429:
What is the main advantage of using deterministic modeling in scheduling algorithm evaluation?
A. It provides exact numbers for comparison
B. It uses real-time data to predict performance
C. It allows predictions for future workload behavior
D. It simulates multiple real-world workloads
Correct Answer:
A
Chapter: 17
Q430:
Which of the following scheduling algorithms uses First-Come-First Serve (FCFS) in case of a tie?
A. UNIX System V scheduling algorithm
B. Multilevel Feedback Queue scheduling
C. Shortest Job First (SJF)
D. Round Robin (RR)
Correct Answer:
A
Chapter: 17
Q431:
The formula for Little's law in queuing theory is __________.
A. n = λ * W
B. W = n * λ
C. λ = W * n
D. n = W + λ
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
Q438:
The priority number in UNIX System V scheduling is updated every __________.
A. Second
B. Millisecond
C. Tenth of a second
D. Every minute
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A
Chapter: 17
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
Correct Answer:
A