in side the project.zip there are some file the you will use as input and "README" .you should read the data file "README" to know how to make the program. Also there are some data file "1p9595" and other you will use as input file.

Develop a simulation program toinvestigate the relative effectiveness of the FIFO, LRU, and OPT pagereplacement strategies. Your program should measure the number of pagefaults generated by each strategy.

Your simulator should read areference string from a file. The reference string items will be of theform: , where PID is a process ID and page ref is a page of thatprocess' logical memory. There will be one reference per line of thefile. For example, the following might be the beginning of an inputfile:

1 45

1 46

1 45

1 44

1 45

2 45

2 46

2 47

2 47

2 46

Thisreference string corresponds to Process 1 accessing its pages 45, 46,45, 44, and 45, then Process 2 accessing its pages 45, 46, 47, 47, and46. We will assume a pure demand paging system (i.e., no pre­fetching).The simulation also must allow the number of physical frames to bespecified. So for example, if there are 3 or more frames available, theabove reference string will cause 6 page faults for all three strategies(one for each time a new page is referenced). If there are only 2frames available, then there would be 6 page faults for LRU and OPT, and7 page faults for FIFO.

Theinput file name and the number of physical frames may be enteredinteractively or on the command­line. The output for this simulation isthe number of page faults generated for each replacement strategy.

Forthe purposes of making this simulation manageable, assume a program has2 megabytes (2048 kilobytes) of virtual memory divided into 1K pages(i.e., a program can generate page references from 0 to 2047), and therewill no more than 150 processes (PIDs 0 to 149). We also will assume aglobal replacement strategy. That is, when a page fault occurs, thevictim page can be taken from any process. We will ignore the issue ofdirty pages by assuming that all victim pages have not been modified.

Assignment (40 points)

(20points) This project is to be done individually. Each student mustimplement a simulation meeting the specifications above for each pagereplacement algorithm with a physical memory size (in frames) that canbe set for each run of the program.

The simulator may be writtenin any language for either Linux (projects must run on csserver) orWindows (projects using any IDE available in CS Lab are acceptable).However, the instructor can provide assistance only for C/C++ projects,and maybe Java projects. Provide a makefile that will make your projectif it needs to be compiled. The file names and frame number value may beprovided to the simulation either as command­line arguments orinteractively. Hardcoding the test file names or frame number valuesinto the program is not acceptable.

What to Submit

Create a tarfile or zipfile containing the following:

• Thewell­ documented code source code for your project. If you aresubmitting a Windows project, submit the entire project folder
• A makefile to make your project, if needed
• A single document in PDF format containing(output):

1-instructions on how to build and/or run the program.