CMSC 421, Principles of Operating Systems. Fall 2004
Computer Science & Electrical Engineering Department
University of Maryland Baltimore County

Homework 3.

Due by 11:59pm EST on Nov 23, 2004.

[4 x 20 = 80 points]

  1.  
    1. Given memory partitions of 100KB, 500KB, 200KB, 300KB and 600KB (in order), how would each of the First-fit, best-fit, and worst-fit algorithms place processes of 212KB, 417KB, 112KB, 426KB and 50KB (in order)? Which algorithm makes the most efficient use of memory?
    2. Exercise 9.8 on page 314 of the text.

  2. Consider the following page-reference string:

    1,1,2,3,4,3,4,2,1,5,1,2,3,4,5,6,6,1,6,3,2,1,6,3,4,6.

    How many page faults would occur for the following replacement algorithms, assuming one, three, five, six or eight frames? Remember that all the frames are initially empty, so you first unique pages will all cost one fault each.

  3. Problem 12.6 (page 450) from the text.

  4. Problem 13.2 (pages 487-488) from the text.

What and how to submit

As always you should submit your homework as a single PDF file via the link provided in Blackboard under "Course documents". Please name your file "hw3.pdf". Remember to write your name as well as user-id on your homework submissions.