1. Paul, #5.1, pg 177 - 5 points 
  1. Paul, #5.5, pg 178 - 5 points
     
  1. S&G, #8.2, pg 284 - 3 Points
    Explain the difference between internal and external fragmentation.
     
  1. S&G, #8.5, pg 285 - 5 Points
    Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 122K, and 426K (in order)? Which algorithm makes the most efficient use of memory?
     
  1. S&G, #8.8, pg 285 - 5 points
    Consider a logical address space of eight pages of 1024 words each, mapped onto physical memory of 32 frames.
    1. How many bits are there in the logical address?
    2. How many bits are there in the physical address?
  1. S&G, #8.10, pg 285 - 5 points
    Consider a paging system with the page table stored in memory.
  1. S&G, #8.14, pg 286 - 3 points
    Explain why it is easier to share a reentrant module using segmentation that it is to do so when pure paging is used.
  1. Tanenbaum #5, pg 142. 3 Points
    A minicomputer uses the buddy system for memory management. Initially it has one block of 256k at address 0. After successive requests for 5k, 25k, 35k, and 20k come in how many blocks are left and what are their sizes and addresses?
     

 

Address

Memory

Size

=>

Address

Memory

Size

0

5K

8K

0

5K

8K

8K

 

8K

8K

 

8K

16K

 

16K

16K

 

16K

32K

25K

32K

32K

25K

32K

64K

35K

64K

64K

35K

64K

128K

 

128K

128K

20K

32K

160K

 

32K

192K

 

64K