Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 15
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
Correct Answer:
B
Chapter: 15
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
Correct Answer:
B
Chapter: 15
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
Correct Answer:
A
Chapter: 15
Q384:
Priority scheduling assigns the CPU to the process with the __________ priority.
A. highest
B. lowest
C. random
D. longest
Correct Answer:
A
Chapter: 15
Q385:
Aging in priority scheduling is used to prevent __________.
A. starvation
B. preemption
C. CPU bursts
D. context switching
Correct Answer:
A
Chapter: 15
Q386:
In Priority Scheduling, if two processes have the same priority, which scheduling is used?
A. Round Robin
B. FCFS
C. SJF
D. SRTF
Correct Answer:
B
Chapter: 15
Q387:
A process may experience indefinite blocking in __________ scheduling.
A. Shortest-Job-First (SJF)
B. Priority Scheduling
C. Round Robin
D. FCFS
Correct Answer:
B
Chapter: 15
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
Correct Answer:
A
Chapter: 15
Q389:
The SJF algorithm can be used in both __________ and __________ versions.
A. preemptive, non-preemptive
B. FIFO, LIFO
C. static, dynamic
D. permanent, temporary
Correct Answer:
A
Chapter: 15
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
Correct Answer:
A
Chapter: 15
Q391:
The SRTF algorithm is a preemptive version of __________.
A. Round Robin
B. Shortest-Job-First
C. Priority Scheduling
D. FCFS
Correct Answer:
B
Chapter: 15
Q392:
Aging in priority scheduling involves __________ the priority of long-waiting processes to prevent starvation.
A. decreasing
B. increasing
C. resetting
D. locking
Correct Answer:
B
Chapter: 15
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
Correct Answer:
A
Chapter: 15
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
Correct Answer:
A
Chapter: 15
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
Correct Answer:
B
Chapter: 16
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)
Correct Answer:
B
Chapter: 16
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
Correct Answer:
B
Chapter: 16
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
Correct Answer:
A
Chapter: 16
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
Correct Answer:
B
Chapter: 16
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
Correct Answer:
C