Question 1 : Which of the following scheduling algorithms gives minimum average waiting time ?
1. FCFS
2. SJF
3. Round – robin
4. Priority
View Answer   Discuss with Members

Question 2 : 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
1. i only
2. i and iii only
3. ii and iii only
4. i, ii and iii
View Answer   Discuss with Members

Question 3 : A solution to the problem of indefinite blockage of low – priority processes is :
1. Starvation
2. Wait queue
3. Ready queue
4. Aging
View Answer   Discuss with Members

Question 4 : One of the disadvantages of the priority scheduling algorithm is that :
1. it schedules in a very complex manner
2. its scheduling takes up a lot of time
3. it can lead to some low priority process waiting indefinitely for the CPU
4. none of the mentioned
View Answer   Discuss with Members

Question 5 : An SJF algorithm is simply a priority algorithm where the priority is :
1. the predicted next CPU burst
2. the inverse of the predicted next CPU burst
3. the current CPU burst
4. anything the user wants
View Answer   Discuss with Members

Question 6 : Preemptive Shortest Job First scheduling is sometimes called :
1. Fast SJF scheduling
2. EDF scheduling – Earliest Deadline First
3. HRRN scheduling – Highest Response Ratio Next
4. SRTN scheduling – Shortest Remaining Time Next
View Answer   Discuss with Members

Question 7 : The FCFS algorithm is particularly troublesome for ____________
1. time sharing systems
2. multiprogramming systems
3. multiprocessor systems
4. operating systems
View Answer   Discuss with Members

Question 8 : The real difficulty with SJF in short term scheduling is :
1. it is too good an algorithm
2. knowing the length of the next CPU request
3. it is too complex to understand
4. none of the mentioned
View Answer   Discuss with Members

Question 9 : The most optimal scheduling algorithm is :
1. FCFS – First come First served
2. SJF – Shortest Job First
3. RR – Round Robin
4. None of the mentioned
View Answer   Discuss with Members

Question 10 : 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
1. I only
2. I and III only
3. II and III only
4. I, II and III
View Answer   Discuss with Members