Dale - Computer Science Illuminated 372

Dale - Computer Science Illuminated 372 - being managed by...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Exercises 345 a. first fit b. best fit c. worst fit 29. Why shouldn t we use worst-fit partition selection in a fixed-partition memory-management scheme? 30. Distinguish between a page and a frame. 31. How does the page map table keep track of the relationship between a page and a frame? 32. If, in a paged memory-management system, the frame size is 1024 and the following page map table applies to the currently executing process, compute the physical addresses that correspond to the following logical addresses: a. < 1, 501 > b. < 0, 85 > c. < 3, 1048 > d. < 4, 419 > e. < 2, 311 > 33. What is virtual memory and how does it apply to demand paging? 34. What are the conceptual stages through which a process moves while
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: being managed by the operating system? 35. Describe how a process might move through the various process states. Create specific reasons why this process moves from one state to another. 36. What is a process control block? 37. How is each conceptual stage represented in the OS? 38. What is a context switch? 39. Distinguish between preemptive scheduling and nonpreemptive sched-uling. 40. Name and describe three CPU scheduling algorithms. Use the following table of processes and service time for Exercises 41 through 43. Frame 7 12 99 1 4 Page 1 2 3 4...
View Full Document

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online