Cpu Scheduling Algorithms 2 — Test 1
Page 1 of 1
Question 1
The FCFS algorithm is particularly troublesome for ____________
0
System Administrator 2026
Question 2
The real difficulty with SJF in short term scheduling is ____________
0
System Administrator 2026
Question 3
Consider the following set of processes, the length of the CPU burst time given in milliseconds. Process Burst time P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm.
0
System Administrator 2026
Question 4
Preemptive Shortest Job First scheduling is sometimes called ____________
0
System Administrator 2026
Question 5
An SJF algorithm is simply a priority algorithm where the priority is ____________
0
System Administrator 2026
Question 6
Choose one of the disadvantages of the priority scheduling algorithm?
0
System Administrator 2026
Question 7
What is ‘Aging’?
0
System Administrator 2026
Question 8
A solution to the problem of indefinite blockage of low – priority processes is ____________
0
System Administrator 2026
Question 9
Which of the following statements are true? (GATE 2010) i) Shortest remaining time first scheduling may cause starvation ii) Preemptive scheduling may cause starvation iii) Round robin is better than FCFS in terms of response time
0
System Administrator 2026
Question 10
Which of the following scheduling algorithms gives minimum average waiting time?
0
System Administrator 2026