Suppose that a disk drive has 100 cylinders, numbered from 0 to 99. The queue which is maintained is 10, 20, 50, 70, 80 in order. The disk arm is initially at cylinder 40. Starting from the current head position, what is the total distance for following algorithms?

Midterm Questions Name:
⦁ Allocate the following processes  to the Main Memory Frames by using First Fit, Best Fit and Worst Fit Algorithms.

⦁ How many Page Faults and Page Replacement occur with the following reference string for three-page frames?
⦁ Using FIFO Algorithm
1 2 3 4 5 4 3 2 4 2 3

Page Fault : Page Replacement:
⦁ Using OPR Algorithm
1 2 3 4 5 4 3 2 4 2 3

Page Fault : Page Replacement:
⦁ Using LRU Algorithm
1 2 3 4 5 4 3 2 4 2 3

Page Fault : Page Replacement:

⦁ Consider the following four processes with the length of CPU burst time in milliseconds . Calculate the average waiting time by using following algorithms

⦁ Suppose that a disk drive has 100 cylinders, numbered from 0 to 99. The queue which is maintained is 10, 20, 50, 70, 80 in order. The disk arm is initially at cylinder 40. Starting from the current head position, what is the total distance for following algorithms?

Last Completed Projects