NEW
Font size
WorksheetsCPU Scheduling Algorithms Quiz
Total questions: 15
Worksheet time: 5mins
What is the main purpose of CPU scheduling algorithms?
To increase the number of processes in the queue
To minimize CPU utilization
To ensure fairness among parties utilizing resources
To maximize resource starvation
What does CPU utilization refer to?
The total time taken for all jobs
The ratio of total CPU burst to total processing time
The number of processes completed per time unit
The time taken from submission to completion
Which of the following is a non-preemptive CPU scheduling algorithm?
Preemptive Priority
First Come First Served (FCFS)
Round Robin (RR)
Shortest Remaining Time First (SRTF)
What is the definition of turn-around time?
Time from submission to completion of a process
Time spent waiting in the queue
Time taken to respond to a request
Time the CPU is busy processing
In a non-preemptive priority scheduling algorithm, what happens if two jobs have the same priority?
The job with the longest burst time is executed first
The operating system randomly selects a job
Both jobs are executed simultaneously
The job that arrived first is executed first
What does throughput measure in CPU scheduling?
The time taken for the first response
The number of processes completed per time unit
The total CPU burst time
The average waiting time of processes
Which scheduling algorithm is known as First In First Out (FIFO)?
Shortest Job First (SJF)
First Come First Served (FCFS)
Round Robin (RR)
Non-preemptive Priority (NPP)
What is the main characteristic of a preemptive scheduling algorithm?
Processes run until completion
Processes can be interrupted and moved to ready state
All processes are executed in the order they arrive
No process can be interrupted once started
In Round Robin scheduling, what happens if the time slice is greater than the burst time?
The process is terminated immediately
The process is paused until the next time slice
The process is executed until completion
The process is moved back to the ready queue
What is the response time in CPU scheduling?
Total time the CPU is busy
Time spent waiting in the queue
Time taken from submission to the first response
Time taken to complete a process
Which of the following is a characteristic of non-preemptive scheduling?
Processes are executed in a round-robin manner
Processes run until they terminate
Processes can be interrupted
Processes are executed based on priority
What does waiting time refer to in CPU scheduling?
Time from submission to first response
Time a process spends in the ready queue
Time taken to execute a process
Total time the CPU is busy processing
Which algorithm checks for the shortest remaining time first?
Round Robin (RR)
Shortest Remaining Time First (SRTF)
Shortest Job First (SJF)
First Come First Served (FCFS)
What is the highest priority in a non-preemptive priority scheduling algorithm?
2
3
1
0
What happens in Shortest Job First (SJF) scheduling?
All jobs are executed simultaneously
Jobs are executed in the order they arrive
The longest job is executed first
The job with the shortest burst time is executed first
