hw7 - 4003-440 and 4003-713 Operating SystemsHomework #7Due...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 4003-440 and 4003-713 Operating SystemsHomework #7Due February 7, 2007Name: _________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 parition2.417K in 600K partition3.112K in 288K partition4.426K waitsb. Best-fit:1.212K in 300K partition2.417K in 500K partition3.112K in 200K partition4.426K in 600K partitionc. Worst-fit:1.212K in 600K partition2.417K in 500K partition3.112K in 388K partition4.426K waitsBest-fit is the most efficient2. 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 modify the paging scheme to allow a process to access another process’ memory?...
View Full Document

This note was uploaded on 04/11/2008 for the course GCCIS 440 taught by Professor Unknown during the Winter '06 term at RIT.

Page1 / 3

hw7 - 4003-440 and 4003-713 Operating SystemsHomework #7Due...

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

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