Answer Happy

Assume a main memory with four page frames (frame A through frame D). Assume that the sequence of pages requested by a process is as shown below. 5, 0,9. 7, 5, 7, 8, 1,5, 0.7 For each reference in the above sequence, identify whether it will cause a page fault (F) or will result in a page hit (H), when using the least recently used page replacement algorithm. Use the table provided for your solutions - use the Status column to indicate F or H and the Page Frame column to indicate the page frame into which the page has been loaded. Assume that all page frames are initially empty. Note: the first few entries are already filled out for your reference. Page 5 0 97 5 7 [Select] 8 00 T 5 0 [Select] 7 [Select] Select] [Select] [Select] [Select] Status F F F F > V 2 Y [Select] Page Frame A B C D [Select] [Select] [Select] [Select] V [Select] V [Select] > > > > > > <