Font size
WorksheetsOSS (QUIZ 4) CPU Scheduling Quiz
Total questions: 30
Worksheet time: 23mins
What is the primary goal of CPU scheduling?
Minimize CPU usage
Maximize turnaround time
Ensure all processes finish at the same time
Minimize response time
Which CPU scheduling algorithm selects the process that arrives first?
Round Robin
Shortest Job Next
First-Come, First-Served
Priority Scheduling
In Round Robin (RR) scheduling, what does the time quantum represent?
Maximum execution time per process cycle
The total time all processes get to run
The priority of each process
The waiting time for the longest process
Which scheduling algorithm always selects the process with the shortest burst time?
First-Come, First-Served
Shortest Remaining Time First
Round Robin
Priority Scheduling
Which scheduling algorithm prevents starvation by aging lower-priority processes?
First-Come, First-Served
Shortest Job Next
Priority Scheduling
Multilevel Queue Scheduling
What happens in Preemptive Scheduling?
A process runs until it voluntarily releases the CPU
A higher-priority process can interrupt a running process
Only background processes are scheduled
CPU scheduling is disabled
Which of the following is a disadvantage of First-Come, First-Served (FCFS)?
Causes starvation
Complex implementation
High average waiting time for large processes
Requires multiple queues
What is the major advantage of Shortest Job Next (SJN) scheduling?
Maximizes response time
Reduces average waiting time
Ensures fair process execution
Always prevents starvation
Which scheduling algorithm is commonly used in time-sharing systems?
First-Come, First-Served
Shortest Job Next
Round Robin
Priority Scheduling
Which metric measures the time a process spends waiting in the ready queue?
Turnaround Time
Response Time
Waiting Time
Completion Time
CPU scheduling only applies to multiprogramming systems.
TRUE
FALSE
Round Robin scheduling is ideal for real-time systems.
TRUE
FALSE
Shortest Job Next (SJN) can cause starvation of long processes.
TRUE
FALSE
Response time is always greater than or equal to waiting time.
TRUE
FALSE
In a preemptive system, a process can be interrupted before completion.
TRUE
FALSE
Turnaround time is the sum of waiting time and burst time.
TRUE
FALSE
The dispatcher is responsible for selecting a process from the ready queue.
FASLE
TRUE
A high-priority process in Priority Scheduling always executes before a lower-priority one.
FALSE
TRUE
Multilevel Queue Scheduling divides processes into multiple priority queues.
FALSE
TRUE
First-Come, First-Served scheduling is the simplest but often inefficient.
TRUE
FALSE
A process arrives at time 0 and has a burst time of 5. If it starts execution immediately, what is its Turnaround Time?
(a)
A process arrives at time 3, starts execution at 5, and finishes at 10. What is its Waiting Time?
(a)
A process has a burst time of 10 and a waiting time of 5. What is its Turnaround Time?
(a)
A Round Robin system has a time quantum of 4. If a process has a burst time of 10, how many cycles will it take?
(a)
If four processes (P1, P2, P3, P4) have burst times 3, 6, 4, and 5 and are scheduled using FCFS, what is the waiting time of P3?
(a)
Calculate Response Time if a process arrives at 2, starts execution at 7.
(a)
A process has a turnaround time of 12 and a burst time of 8. What is its waiting time?
(a)
A process arrives at time 2 and completes execution at time 15. Its turnaround time is 13. What is its arrival time?
(a)
In a non-preemptive SJF scheduling, what is the first process to execute if burst times are P1 = 8, P2 = 4, P3 = 2, and P4 = 5?
(a)
A process starts execution at 3, completes at 12, and has a response time of 2. What is its arrival time?
(a)
