{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

hw7 - 4003-440 and 4003-713 Operating Systems Homework#7...

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

View Full Document Right Arrow Icon
4003-440 and 4003-713 Operating Systems Homework #7 Due February 7, 2007 Name: _________TJ Wasik ________________________Section: _________01 ________________ 1. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory? Answer: a. First-fit: 1. 212K in 500K parition 2. 417K in 600K partition 3. 112K in 288K partition 4. 426K waits b. Best-fit: 1. 212K in 300K partition 2. 417K in 500K partition 3. 112K in 200K partition 4. 426K in 600K partition c. Worst-fit: 1. 212K in 600K partition 2. 417K in 500K partition 3. 112K in 388K partition 4. 426K waits Best-fit is the most efficient 2. On a system with paging, a process cannot access memory that it does not own. How does the operating system use paging to enforce this? How could the operating system modify the paging scheme to allow a process to access another process’ memory? What are reasons for and against allowing this?
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}