Homework 10

1. (15 points) Given memory partitions (i.e., "holes") of size 100Kb, 500Kb, 200Kb, 300Kb, and 600Kb (in that order), how would a sequence of processes of size 212Kb, 417Kb, 112Kb, and 426Kb, coming in in that order, be placed in memory using:
   • first fit
   • best fit
   • worst fit
   (Assume that compaction is not used.)
   
   
2. (15 points)

   Suppose a process has the following segment table:
   
   

   Segment	Base	Limit
   0	219	600
   1	2300	14
   2	90	100
   3	1327	580
   4	1952	96

   
   If the process generates the following logical addresses, what are the corresponding physical addresses?

   1. 0,430
   2. 1,10
   3. 2,500
   4. 3,400
   5. 4,112

3. (15 points)

   Suppose we have a (tiny) system with a page size of 256 bytes. Suppose a process has the following page table:
   
   

   Frame	Valid
   8	V
   7	V
   6	V
   9	V
   0	I

   
   If the process generates the following logical addresses, what are the corresponding physical addresses? Note: logical addresses are in hexadecimal, give your answer in hexadecimal also (this makes the math much easier).

   1. 0000
   2. 010F
   3. 023C
   4. 03A4
   5. 0444

Please save your answers in the file hw10.txt and use

    ~cs352/bin/turnin hw10