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. 4, 7, 2, 8, 4, 8, 1, 3, 4, 7, 8 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 4 7 2 8 4 8 1 3 4 7 8 [Select] [Select] [Select] [Select] [Select] [Select] [ Select] Status, F -F F F V Y Page Frame. A B C D [Select] [Select] [Select] [Select] [Select] [Select] [Select]