Who are the experts?Experts are tested by jovemaprendiz2019.org as specialists in their subject area. We review their content and use your feedback to keep the quality high.
You are watching: Which of the following is true of cooperative scheduling?
SOLUTIONS Question no1: A process keeps the CPU release the CPU either by terminating or by s…View the full answer
Transcribed image text: 1. Which of the following is true of cooperative scheduling? D) A process switches from the running state to the ready state when an interrupt occurs. C) It incurs a cost associated with access to shared data. B) A process keeps the CPU until it releases the CPU either by terminating or by A) It requires a timer. 2. ___ is the number of processes that are completed per time unit. C) Turnaround time A) CPU utilization D) Through put turnaround time B) Response time 3. ___ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts. A) Multilevel queue B) RR D) SJF C) FCFS 4. The ___ scheduling algorithm is designed especially for time-sharing systems. D) Multilevel queue C) RR B) FCFS A) SJF 5. Which of the following scheduling algorithms must be nonpreemptive? B) RR A) SJF D) priority algorithms C) FCFS 6. Which of the following is true of multilevel queue scheduling? D) It is the most general CPU- scheduling algorithm. B) Each queue has its own scheduling algorithm. A) Processes can move between queues. C) A queue cannot have absolute priority over lower-priority queues. 7. The default scheduling class for a process in Solaris is. C) interactive B) system D) real-time A) time sharing 8. Which of the following statements are false with regards to the Linux CFS scheduler? D) The scheduler doesn't directly assign priorities. A) Each task is assigned a proportion of CPU processing time. B) Lower numeric values indicate higher relative priorities. C) There is a single, system-wide value of vruntime. 9. The Linux CFS scheduler identifies as the interval of time during which every runnable task should run at least once. A) virtual run time D) load balancing B) targeted latency C) nice value 10. In Little's formula, Lamda, represents the B) average arrival rate for new processes in the queue C) average queue A) average waiting time in the queue D) average CPU utilization