1) The portion of the process scheduler in an operating system that dispatches processes is concerned with ____________ a) a) assigning ready processes to CPU b) b) assigning ready processes to waiting queue c) c) assigning running processes to blocked queue d) d) all of the mentioned 2) The strategy of making processes that are logically runnable to be temporarily suspended is called ____________ a) a) Non preemptive scheduling b) b) Preemptive scheduling c) c) Shortest job first d) d) First come First served 3) Orders are processed in the sequence they arrive if _______ rule sequences the jobs. a) a) earliest due date b) b) slack time remaining c) c) first come, first served d) d) critical ratio 4) Which of the following algorithms tends to minimize the process flow time? a) a) First come First served b) b) Shortest Job First c) c) Earliest Deadline First d) d) Longest Job First 5) Which of the following statements are true? (GATE 2010)   I. Shortest remaining time first scheduling may cause starvation III. Round robin is better than FCFS in terms of response time II. Preemptive scheduling may cause starvation III. Round robin is better than FCFS in terms of response time a) a) I only b) b) II only c) c) I and II d) d) None of the above 6) Round robin scheduling falls under the category of ____________ a) a) Non-preemptive scheduling b) b) Preemptive scheduling c) c) All of the mentioned d) d) None of the mentioned 7) An SJF algorithm is simply a priority algorithm where the priority is ____________ a) a) the predicted next CPU burst b) b) the inverse of the predicted next CPU burst c) c) the current CPU burst d) d) anything the user wants 8) What is ‘Aging’? a) a) keeping track of cache contents b) b) keeping track of what pages are currently residing in memory c) c) keeping track of how many times a given page is referenced d) d) increasing the priority of jobs to ensure termination in a finite time 9) Which of the following scheduling algorithms gives minimum average waiting time? a) a) FCFS b) b) SJF c) c) Round – robin d) d) Priority 10) The interval from the time of submission of a process to the time of completion is termed as ____________ a) a) waiting time b) b) turnaround time c) c) response time d) d) throughput

CPU Scheduling Algorithms

列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?