Implementation of FIRST IN FIRST OUT page replacement algorithm LEAST RECENTLY USED page replacement algorithm OPTIMAL page replacement algorithm with random generated values
problem: Write a program that implements the FIFO page replacement algorithm. First, generate a random page-reference string where page numbers range from 0 to 9. Apply the random page-reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithm so that the number of page frames can vary from 1 to 7. Assume that demand paging is used.