======================================================================
		      CMSC 421 Operating Systems
			  Krishna Sivalingam
			      Spring 2006
				Quiz 2
			  Date: April 13, 2006
		       Time Alloted: 40 Minutes

			Open Book, Open Notes.

		      NO consultations allowed.
======================================================================

NAME:

1. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and
   600 KB (in order of increasing starting memory address for each
   partition), how would each of first-fit and best-fit algorithms
   place processes of sizes 212 KB, 417 KB, 112 KB and 426 KB (in
   order of arrival)?

2. Consider a paged memory system with a 32-bit memory address and a 8
   KB page size. Consider a process with six logical pages and a
   corresponding page table of:

   -----------------------------
   Logical Page #    |  Frame #
   -----------------------------
   0		     |   13
   1		     |   8
   2		     |   18
   3		     |   12
   4		     |   11
   5		     |   16
   -----------------------------

   What is the physical memory address value for the logical
   address of 16386? Show your calculations.

   What is the logical address corresponding to the physical memory
   address of 90115? Show your calculations.

   Assume that the entire page table is stored in memory and reading a
   location from memory takes 200 nanoseconds. How long does it take
   for the process to access a given logical address?

=====================================================================