Homework-3

Homework-3 - Fall 2009 CSC 4103 Operating Systems Homework...

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

View Full Document Right Arrow Icon
Fall 2009 CSC 4103 – Operating Systems Homework Assignment #3 The due date is: November 5 th , Thurday, before the class. Late submission is not allowed. Problem 1: Explain the difference between internal and external fragmentation. Suggest ways to prevent each. Problem 2: 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? Problem 3: Compare paging with segmentation with respect to the amount of memory required by the address translation structures in order to convert virtual addresses to physical addresses. Problem 4: Consider a paging system with the page table stored in memory. a) If a memory reference takes 200 nanoseconds, how long does a paged memory reference take? b)
Background image of page 1

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

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

This note was uploaded on 10/01/2011 for the course CSC 4103 taught by Professor Ullmer,b during the Fall '08 term at LSU.

Page1 / 2

Homework-3 - Fall 2009 CSC 4103 Operating Systems Homework...

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