The University of Texas at Dallas--Computer Science Program

CS 5348.501—Quiz 5

Name:_____________________

UTD ID #:_________________

1. Consider Belady’s optimal algorithm for page replacement (in static allocation) with 3 frames to the process. Show the each page’s allocation and replacement at each instant and find the total number of page faults for the reference string: 1 3 8 7 5 3 8 1 3 7 4 5.

2. If the Shortest Remaining Time First (preemptive) scheduling algorithm is run on the following processes , show the schedule.

Process	Arrival time	CPU time needed
A	0	4
B	0	6
C	3	4
D	5	2
E	5	4