a) Starvation b) Wait queue c) Ready queue d) Aging Answer: d Explanation: Aging
View QuestionWhat is ‘Aging’?
a) keeping track of cache contents b) keeping track of what pages are currently residing in memory c) keeping ...
View QuestionChoose one of the disadvantages of the priority scheduling algorithm?
a) it schedules in a very complex manner b) its scheduling takes up a lot of time c) it ...
View QuestionAn 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) ...
View QuestionPreemptive Shortest Job First scheduling is sometimes called ____________
a) Fast SJF scheduling b) EDF scheduling – Earliest Deadline First c) HRRN scheduling – Highest Response Ratio Next
View QuestionThe FCFS algorithm is particularly troublesome for ____________
a) time sharing systems b) multiprogramming systems c) multiprocessor systems d) operating systems Answer: a Explanation: ...
View QuestionThe 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 ...
View QuestionWhich is the most optimal scheduling algorithm?
a) FCFS – First come First served b) SJF – Shortest Job First c) RR – Round Robin d) None ...
View QuestionUnder multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________
a) Lengthened; Shortened b) Shortened; Lengthened c) Shortened; Shortened d) Shortened; Unchanged Answer: b Explanation: Under multiprogramming, turnaround time for short ...
View QuestionWhich of the following algorithms tends to minimize the process flow time?
a) First come First served b) Shortest Job First c) Earliest Deadline First d) Longest Job First Answer: b Explanation: Shortest ...
View Question