#IMPLEMENTATION IN ANY LANGUAGES#

Project Objective: in completing this project, you will

Fully understand the page replacement mechanisms

Be able to simulate operating system on page replacement works

You need to implement the following page replacement algorithms and apply those on a small input dataset and the give file (the detail instruction is given in the next page):

1. FIFO

2. Optimal

3. Least Recently Used

4. Least Frequently Used

5. LIFO

Detail Instructions:

STEP 1:

One page description of the NEW algorithm you find, including:

o The algorithm itself,

o Provide an simple example to help the understanding,

STEP 2:

After you finished the coding of page replacement algorithms, firstly, apply it to the following input sequence:

Styles Paragraph o Provide an simple example to help the understanding, STEP 2: After you finished the coding of page replacement algorithms, firstly, apply it to the following input ence 1 2 3 4 1 2 5 1 2 3 4 5 This is the input sequence used in the class example) For each algorithm, you need to "print out" the detail process page replacement with 3 and 4 frames by your program as the given example. For example, Number of page fault: 9 FIFO (4 Fram