Good Day,


Would you please help me in this???



I need to solve these questions:

Virtual Memory:

1. What are the three major components of the page‐fault service time?


2. Given the average latency time of hard disk = 8 millisecond, the transfer time=2 millisecond. ,
the seek time= 15 millisecond, and the memory access time=100 nanosecond, and we want less
than 20% degradation what will be the probability of page fault?






3. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 1, 2, 3, 4, 5.

A‐ Sketch the OPT Replacement for 2:5 page frames.

B‐ How many page faults would occur for the three replacement algorithms, assuming one,
two, three, four, and five frames?

C‐ Draw Graph of Page Faults versus the Number of Frames for FIFO, LRU, and OPTIMAL
algorithms. Use Microsoft excel to draw the graph

Remember all frames are initially empty, so your first unique pages will all cost one fault each.

Posting in all of the forums won't land you help any faster if at all.
Dream.In.Code has a policy by which we prefer to see a good faith effort on your part before providing source code for homework assignments. Please post the code you have written in an effort to resolve the problem, and our members would be happy to provide some guidance. Be sure to include a description of any errors you are encountering as well.

Please post like this:

Thank you for helping us helping you.