A system uses the second-chance page replacement algorithm. At time i, the four page frames contain the page numbers and r-bits shown below. The pointer is at the page to be considered next. At time i + 1, page 8 is referenced. Show all changes as a result of the reference. Timet i i +1 Frame 0 501 Ex: 3 Frame 1 710 Frame 2 610 Frame 3 +41 At time i + 1, which page is the pointer at? Ex: 3 At time i, the four page frames contain the pages shown below. Timet i The points to the oldest resident page. Page size = 512 words. The system uses the FIFO page replacement algorithm. Frame 0 7 Frame 1 1 Frame 2 4 Frame 3 6 For each virtual address VA, enter the corresponding page number p and whether that VA will cause a page fault at time i+1. Page fault at time i+1 VA = 829 p = Ex: 9 VA = 3913 p = VA = 283 p = VA = 2196 p = The page fault will replace page Ex: 9 and the pointer will move to page Assume a virtual memory that uses segmentation and paging for a single process. Segment table and page table entries contain frame numbers of the corresponding page tables or pages. Size of segment table = size of page table = size of page = size of frame = 512 words. Segment table (ST) starts at address 0 of physical memory. Physical memory (PM) has the following contents: 0 1 2 3 4 512 513 514 2051 2052 PM 4 3 1 07 5 2 7 8 9 10 6 The virtual address VA = (0, 3, 4) corresponds to the physical address PA = Ex: 1000 The virtual address VA = (2, 1, 7) corresponds to the physical address PA = The virtual address VA = (0, 4, 12) corresponds to the physical address PA = A system uses the second-chance page replacement algorithm. At time i, the four page frames contain the page numbers and r-bits shown below. The pointer is at the page to be considered next. At time i + 1, page 8 is referenced. Show all changes as a result of the reference. Timet i i +1 Frame 0 501 Ex: 3 Frame 1 710 Frame 2 610 Frame 3 +41 At time i + 1, which page is the pointer at? Ex: 3 At time i, the four page frames contain the pages shown below. Timet i The points to the oldest resident page. Page size = 512 words. The system uses the FIFO page replacement algorithm. Frame 0 7 Frame 1 1 Frame 2 4 Frame 3 6 For each virtual address VA, enter the corresponding page number p and whether that VA will cause a page fault at time i+1. Page fault at time i+1 VA = 829 p = Ex: 9 VA = 3913 p = VA = 283 p = VA = 2196 p = The page fault will replace page Ex: 9 and the pointer will move to page Assume a virtual memory that uses segmentation and paging for a single process. Segment table and page table entries contain frame numbers of the corresponding page tables or pages. Size of segment table = size of page table = size of page = size of frame = 512 words. Segment table (ST) starts at address 0 of physical memory. Physical memory (PM) has the following contents: 0 1 2 3 4 512 513 514 2051 2052 PM 4 3 1 07 5 2 7 8 9 10 6 The virtual address VA = (0, 3, 4) corresponds to the physical address PA = Ex: 1000 The virtual address VA = (2, 1, 7) corresponds to the physical address PA = The virtual address VA = (0, 4, 12) corresponds to the physical address PA =
