Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Computer Operation System / Architecture: Memory Management Please fill in the t

ID: 3820399 • Letter: C

Question

Computer Operation System / Architecture: Memory Management

Please fill in the table and explanation would be appreciated.Thanks

Consider the following page reference string: 3, 1, 3, 7, 7, 1,0, Assuming demand paging with 3 frames, fill in the table to indicate pages in the frames, page fault if any, and total number of page faults, for the following page replacement algorithms. (a) LRU 2 4 5 6 7 8 9 10 11 12 13 14 15 Time Reference Frame 0 Frame 1 Frame 2 Page fault? (Y/N) Total page faults J (b) FIFo D1 L2 3 L4 d7 19 10 11 12 E13 14 15 Time 3 1 2 5 3 4 6 7 7 5 4 Reference Frame 0 7 7 Frame 1 Frame 2 Page fault? (Y/N) Total page faults

Explanation / Answer

LRU (Least Recently Used):

Total page faults = 13

FIFO (First In First Out):

Total page faults = 12

Time 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Reference 7 2 3 1 2 5 3 4 6 7 7 1 0 5 4 Frame 0 7 7 7 1 1 1 3 3 3 7 7 7 7 5 5 Frame 1 X 2 2 2 2 2 2 4 4 4 4 1 1 1 4 Frame 2 X X 3 3 3 5 5 5 6 6 6 6 0 0 0 Page fault? (Y/N) Y Y Y Y N Y Y Y Y Y N Y Y Y Y
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote