CS 110 Homework Assignment 5
Due: Saturday 14 April, 9PM

  1. OSC, 6.15, pg 479, 4 Points
    Supermarkets are constantly faced with a problem similar to page reference in virtual memory systems. They have a fixed amount of shelf space to display an ever-increasing number of products. If an important new product comes along, say, 100% efficient dog food, some existing product must be dropped from the inventory to make room for it. The obvious replacement algorithms are LRU and FIFO. Which of these would you prefer?
  2. OSC, 6.16, pg 479, 3 Points
    Why are cache blocks always much smaller than virtual memory pages, often a hundred times smaller?
  3. s.8.16, pg 288, 4 Points
  4. s.9.3, pg 331, 4 Points
  5. s.9.5, pg 331, 4 Points
  6. s.9.9, pg 332, 4 Points
  7. s.9.17, pg 334, 4 Points

Last modified April 5, 01 by mike@cs.hmc.edu