CS162, Spring 1998
Midterm 2
Professor Alan Smith
Problem #1
What is the relocation table? What is in it? How does the loader use it? (10)
Problem #2
Suppose we have hardware that supports segmentation. Could we use it to support paging instead? Why or
why not? (10)
Problem #3
Could we do page replacement in main memory on a set associative basis? Why or why not? How would it
work? What are the tradeoffs? (10)
Problem #4
Given that the following cylinders have I/O requests pending, that the requests arrived in the order shown,
that the disk head is currently at track 9, and that the last two requests serviced were on cylinders 8 and 9 (in
that order), show the sequence in which the I/O requests are serviced (by listing their cylinder numbers) for
each of the following scheduling algorithms. (12)
4 19 20 2 10 21 7 1 26 3 9 11
a) FIFO
b) SSTF
c) SCAN
d) CSCAN
Problem #5
Give the number of page faults for LRU, FIFO, OPT for the following reference string, for memories of size
3 and 4. (no partial credit...) (14)
5 4 3 2 5 4 6 5 4 3 2 6
Also give the number of page faults if the working set parameter is 3.5.
  3 4
FIFO
LRU
OPT
Working Set:
Problem #6
The following questions are true/false. No partial credit will be given for missing answers. The questions you
answer will be graded (right-wrong). (44)
___a. According to the "fast file system for unix" paper, the randomization of disk blocks over the disk
CS162, Midterm #2, Spring 1998
CS162, Spring 1998 Midterm 2 Professor Alan Smith 1
