Score for this attempt: 2 out of 10 Submitted Feb 9 at 1:37pm This attempt took 18 minutes. correct Question 1 0/1 pts The first measure of time a process spends in the ready queue is called CPU utilization None of the listed answers Waiting time Dispatch latency Response time Incorrect Question 2 0/1 pts hings love hiphop b... 33,147 unread) - carlpeter.mat.. fau canvas - findsearchresults.c... 04 - Dispatch latency Response time Incorrect Question 2 0/1 pts is the total time a process is active in the system. CPU utilization Turnaround time Response time Waiting time None of the listed answers MacBook Pro canvas.fau.edu hop b... (33,147 unread carlpeter.mat... fau canvas - findsearchresults.c... Question 3 0/1 pts The ____ scheduling algorithm is not practical and is used for comparison with other algorithms. FCFS RR None of the listed answers MLFO MLO correct Question 4 0/1 pts can be used with any priority based CPU scheduling alorardimta incrons les we hiphop b.. (33,147 unreed) - carlpeter.mat... fau canvas - findsearchresults.c... MLQ correct Question 4 0/1 pts can be used with any priority based CPU scheduling algorithm to increase fairness. throughput starvation aging None of the listed answers Incorrect Question 5 0/1 pts The occurs in first come first served scheduling when MacBOOK PID 133,147 Lead) - carlpeter.mat.... fau canvas - findsearchresults.c... Incorrect Question 5 0/1 pts The occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU. convoy effect dispatch latency system-contention scope None of the listed answers waiting time Question 6 1/1 pts The total amount of time spends in the ready oueue w History Book Window Help 3 canvas.fau.edu 132.147. Cartermat fou canvas-finderhetic 04. Proces and se Response time Process time Incorrect Question 7 0/1 pts A problem with a priority scheduling algorithms is determining the length of the next CPU burst calculating the CPU utilization predicting the length of the next CPU burst starvation Incorrect Question 8 0/1 pts IM? A 18 MacBook Pm Dokmarks Window HD canvas.fau.edu strings love hiphop b. (33,147 d) - carlpeter.mat... fau canvas - findsearchresults.c... 0- starvatio Incorrect Question 8 0/1 pts Round-robin (RR) scheduling degenerates to SJF scheduling if the time quantum is too long. True False Question 9 1/1 pts Providing a preemptive, priority-based scheduler guarantees hard real-time functionality True