QUIZIZZ Worksreets Name os_unit2 Class ‘otal questions: 20 Worksheet time: 34mmins Date Instructor name: Mr. Pushpendra Pateriya 1. CPU-scheduling decisions may take place under which of the following circumstances: 1, When a process switches from the running state to the waiting state 2. When a process switches from the running state to the ready state 3. When a process switches from the waiting state to the ready state 4, When a process terminates a) 1.2.34 b) 1.23 0 234 d) tand2 2. Under nonpreemptive scheduling, once the CPU has been allocated to a process, the process keeps the CPU until . 1. it releases the CPU by terminating 2. it releases the CPU by switching to the waiting state 3. it releases the CPU By switching to the ready state 4, itreleases the CPU By switching to the Running state a) 1,2,3 b) 23,4 ©) 12,34 d) 1and2 3. Whenever the CPU becomes idle, the operating system must select one of the processes in the __ to be executed. a) execution queue b) process queue ©) ready queue d) waiting queueThe __ is the module that gives control of the CPU to the process selected by the short- term scheduler. interrupt a) dispatcher b) All of the above ©) scheduler d) scheduler We want to keep the CPU as busy as possible,This criteria refers to as a) CPU utilization b) Throughput ©) Response time If the CPU is busy executing processes, then work is being done. One measure of work is the number of processes that are completed per time unit, called _. a) Response time b) Turnaround time ©) CPU utilization d) Throughput From the point of view of a particular process, the important criterion is how long it takes to execute that process. The interval from the time of submission of a process to the time of completion is the __ a) Response time b) Turnaround time ©) Throughput d) Waiting time Itisdesirableto___. a) minimize waiting time and throughput and to b) minimize CPU utilization and throughput and maximize turnaround time, CPU utilization, to maximize turnaround time, waiting time, and response time and response time ©) maximize CPU utilization and turnaround) maximize CPU utilization and throughput and time and to minimize throughput, waiting to minimize turnaround time, waiting time, time, and response time and response time another measure is the time from the submis ion of a request until the first response is, produced. This measure is called, a) Throughput b) Turnaround time ©) Waiting time d) Response time10. " 12, 13, 14, 15, 16. Which of the following scheduling algorithm is nonpreemptive a) Round-Robin Scheduling b) First-Come, First-Served Scheduling ©) Priority Scheduling d) ShortestJob-First Scheduling Which of the following scheduling algorithm associates with each process the length of the process's next CPU burst a) Priority Scheduling b) Shortest Job-First Scheduling ©) Round-Robin Scheduling d) First-Come, First-Served Scheduling Which of the following scheduling algorithm is provably optimal, in that it gives the minimum average waiting e for a given set of processes. a) Priority Scheduling b) Shortest Job-First Scheduling ©) Round-Robin Scheduling d) First-Come, First-Served Scheduling __is sometimes called shortest-remaining time-first scheduling a) First-Come, First-Served Scheduling b) Preemptive SIF scheduling ©) Round-Robin Scheduling d) Priority Scheduling The next CPU burst of the newly arrived process may be shorter than what is left of the currently executing process. A___will preempt the currently executing process a) nonpreemptive SJF algorithm b) preemptive priority scheduling algorithm ©) preemptive S)F algorithm d) First-Come, First-Served Scheduling The Priority Scheduling algorithm can be a) nonpreemptive Only b) None of the above ©) preemptive Only d) either preemptive or nonpreemptive Asolution to the problem of indefinite blockage of low-priority processes is a) aging b) Paging ©) Swapping d) Switching17, 18, 19, 20, Which of the following statement is True for Aging a) Aging involves gradually increasing the b) Aging involves gradually decreasing the priority of processes that wait in the systern _priority of processes that wait in the system for along time for a long time ©) Aging involves gradually decreasing the d) Aging involves gradually increasing the priority of processes that wait in the systern _ priority of processes that wait in the system for a small time for a small time Consider the given information and calculate average waiting time considering preemptive priority scheduling (higher number means higher priority) a) 3.75 b) 2.75 93 a6 ‘The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are a) FCFS: P1, P3, P2 RR2: P1, P3, P2 b) FCFS: P1, P2, P3 RR2: P1, P2, P3 ©) FCF! 1, P3, P2 RR2: P1, P2, P3 ) FCFS: P1, P2, P3 RR2:P1, P3, P2 Consider the 6 processes following Shortest remaining time first CPU Scheduling with arrival time, Burst time is given. Choose the correct options representing average turnaround time and average waiting time respectively. a) 45 and 7 units respectively b) 4 and 9 units respectively ©) 2.4and 6 units respectively d) 7.1 and 4 units respectivelyAnswer Keys 1. 2) 12.34 2.01234 3. c) ready queue 4, a) dispatcher 5, a) CPU utilization 6. d) Throughput 7, b) Turnaround time 8, d) maximize CPU utilization 9. d) Response time and throughput and to minimize turnaround time, waiting time, and response time 10. b) First-Come, First- 11. b) Shortest Job-First 12. b) Shortest Job-First Served Scheduling Scheduling Scheduling 13, b) Preemptive SIF 14, ©) preemptive SIF 15. d) either preemptive or scheduling algorithm, nonpreemptive 16. a) aging 17. a) Aging involves gradually 18. b) 2.75 increasing the priority of processes that wait in the system for a long time 19, d) FCFS:P1, P2, 20. d) 7.1 and 4 units P3 RR2: P1, P3, P2 respectively