NEW
Font size
WorksheetsCPU Scheduling Algorithms
Total questions: 10
Worksheet time: 3mins
What happens if two processes have equal priority in Preemptive Priority Scheduling?
The one that arrived first gets executed first
They are executed randomly
They are executed simultaneously
What is the edge of the Shortest Job First (SJ F) in the scheduling algorithm?
It ensures every process gets equal CPU time.
It reduces the average waiting time to process.
It is ideal for handling real-time tasks.
Preemptive means once the process is in the running state, it continues to execute until it terminates.
True
False
Which algorithm can lead to starvation of lower-priority processes?
First Come First Serve
Priority Scheduling
Short Job First
What is the primary goal of CPU scheduling algorithms?
To minimize turnaround time only
To ensure fairness among all processes
To maximize CPU utilization
What does ALU stands for?
Advanced Logic Unit
Arithmetic Linear Unit
Arithmetic Logic Unit
In order for you to get the CPU utilization, you would divide the total burst time by the
Arrival Time
Waiting Time
What does the term "turnaround time" refer to in CPU scheduling?
Time taken from arrival to completion of a process
Time spent waiting in the ready queue
Time taken to start executing after arrival
Which of the following is true about FCFS scheduling?
It guarantees the shortest waiting time for all processes.
It can lead to high turnaround times if short processes wait behind long ones.
It is a preemptive scheduling algorithm.
Which of the following is a Non-preemptive CPU Scheduling Algorithm?
Preemptive Priority
First Come First Served
Short Job First
