Final Exam Q&A - Monday 7/2, Back half of Chapter 5...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Monday 7/2, Back half of Chapter 5 and all of chapter 6 , Multiple Choice, T/F questions , Don't forget pink scantron! 20 from 5, 20 from 6, 10 from lecture (Nick is making the test), Chapter 5 Chapter 5 Test Bank 1. Which of the following is true of cooperative scheduling? A) It requires a timer. B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state. **** C) It incurs a cost associated with access to shared data. D) A process switches from the running state to the ready state when an interrupt occurs. 2. ____ is the number of processes that are completed per time unit. A) CPU utilization B) Response time C) Turnaround time D) Throughput ******* 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 C) FCFS D) SJF ***** 4. The ____ scheduling algorithm is designed especially for time-sharing systems. A) SJF B) FCFS C) RR **** D) Multilevel queue 5. Which of the following scheduling algorithms must be nonpreemptive? A) SJF B) RR C) FCFS ****** D) priority algorithms 6. Which of the following is true of multilevel queue scheduling? A) Processes can move between queues. B) Each queue has its own scheduling algorithm. **** C) A queue cannot have absolute priority over lower-priority queues. D) It is the most general CPU-scheduling algorithm. 7. The default scheduling class for a process in Solaris is ____. A) time sharing ******** B) system C) interactive D) real-time 8. In Linux, tasks that are not real-time have dynamic priorities that are based on their ____ values plus or minus the value 5. A) share B) active C) nice ***** D) runqueue 9. In Little's formula, λ, represents the ____. A) average waiting time in the queue B) average arrival rate for new processes in the queue ********* C) average queue length D) average CPU utilization
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10. In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35? A) 25 B) 54 C) 80**** D) 35 11. In Solaris, if an interactive thread with priority 15 uses its entire time quantum, what is its priority recalculated to? A) 51 B) 5*** C) 160 D) It remains at 15 12. In Solaris, if an interactive thread with priority 25 is waiting for I/O, what is its priority recalculated to when it is eligible to run again? A) 15 B) 120 C) 52***** D) It remains at 25 13. ______ allows a thread to run on only one processor. A) Processor affinity ****
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/08/2012 for the course CGS 3269 taught by Professor Staff during the Fall '08 term at University of Central Florida.

Page1 / 6

Final Exam Q&A - Monday 7/2, Back half of Chapter 5...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online