92%(12)11 out of 12 people found this document helpful
This preview shows page 3 - 5 out of 9 pages.
7. One necessary condition for deadlock is ______, which states that a resource can be released only voluntarily by the process holding the resource. A) hold and wait B) mutual exclusion C) circular wait D) no preemption 8. One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P0is waiting for a resource held by P1, P1is waiting for a resource held by P2, and Pnis waiting for a resource held by P0. 9. In a system resource-allocation graph, ____. 10. To handle deadlocks, operating systems most often _____. 11. Relocatable code can be generated for ____. A) compile-time binding B) load-time binding C) execution-time binding D) interrupt binding 12. An address generated by a CPU is referred to as a ____. 13. Suppose a program is operating with execution-time binding and the physical address generated is
300. The relocation register is set to 100. What is the corresponding logical address?
14. _____ is the dynamic storage-allocation algorithm producing the smallest leftover hole in memory. 15. With segmentation, a logical address consists of _____. A) segment number and offset B) segment name and offset C) segment number and page number D) segment table and segment number 16. Which of the following is true of compaction? 17. Which is a benefit of allowing a program that is only partially in memory to execute?