A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

81. The most optimal scheduling algorithm is :
a. FCFS – First come First served
b. SJF – Shortest Job First
c. RR – Round Robin
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).SJF – Shortest Job First

82. The real difficulty with SJF in short term scheduling is :
a. it is too good an algorithm
b. knowing the length of the next CPU request
c. it is too complex to understand
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).knowing the length of the next CPU request

83. The FCFS algorithm is particularly troublesome for ____________.
a. time sharing systems
b. multiprogramming systems
c. multiprocessor systems
d. Operating systems
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).multiprogramming systems

84. 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

i) Assuming the above process being scheduled with the SJF scheduling algorithm :
a. The waiting time for process P1 is 3ms.
b. The waiting time for process P1 is 0ms.
c. The waiting time for process P1 is 16ms.
d. The waiting time for process P1 is 9ms.
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).The waiting time for process P1 is 3ms.

85. 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 :
a. The waiting time for process P2 is 3ms.
b. The waiting time for process P2 is 0ms.
c. The waiting time for process P2 is 16ms.
d. The waiting time for process P2 is 9ms.
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).The waiting time for process P2 is 16ms.

86. 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:
a. The waiting time for process P4 is 3ms.
b. The waiting time for process P4 is 0ms.
c. The waiting time for process P4 is 16ms.
d. The waiting time for process P4 is 9ms.
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).The waiting time for process P4 is 0ms.

87. 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 :
a. The waiting time for process P3 is 3ms.
b. The waiting time for process P3 is 0ms.
c. The waiting time for process P3 is 16ms.
d. The waiting time for process P3 is 9ms.
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).The waiting time for process P3 is 9ms.

88. Preemptive Shortest Job First scheduling is sometimes called :
a. Fast SJF scheduling
b. EDF scheduling – Earliest Deadline First
c. HRRN scheduling – Highest Response Ratio Next
d. SRTN scheduling – Shortest Remaining Time Next
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).SRTN scheduling – Shortest Remaining Time Next

89. An SJF algorithm is simply a priority algorithm where the priority is :
a. the predicted next CPU burst
b. the inverse of the predicted next CPU burst
c. the current CPU burst
d. anything the user wants
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).the predicted next CPU burst

90. One of the disadvantages of the priority scheduling algorithm is that :
a. it schedules in a very complex manner
b. its scheduling takes up a lot of time
c. it can lead to some low priority process waiting indefinitely for the CPU
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).it can lead to some low priority process waiting indefinitely for the CPU

Page 9 of 14