Q

Quiz on paging and virtual memory

(3 Questions)
4 viewed last edited 4 years ago
Paging and virtual memory
0
1
A computer has physical memory that can host 4 pages. The access pattern of a program is as follows: a, b, c, d, a, b, e, f, a, b, e, c, g That is, it access pages in the above order (page a first, then page b and so on). Further, for this quiz, assume that the computer uses LRU (least recently used algorithm) for replacing pages on a page miss. When the program starts, none of these pages are in physical memory.
Does a ever get replaced from physical memory? Answer with true or false
0
1
A computer has physical memory that can host 4 pages. The access pattern of a program is as follows: a, b, c, d, a, b, e, f, a, b, e, c, g That is, it access pages in the above order (page a first, then page b and so on). Further, for this quiz, assume that the computer uses LRU (least recently used algorithm) for replacing pages on a page miss. When the program starts, none of these pages are in physical memory.
After the first 6 pages (a, b, c, d, a, b) are accessed, which page is replaced when page e is accessed next?
A
B
C
D
0
1
A computer has physical memory that can host 4 pages. The access pattern of a program is as follows: a, b, c, d, a, b, e, f, a, b, e, c, g That is, it access pages in the above order (page a first, then page b and so on). Further, for this quiz, assume that the computer uses LRU (least recently used algorithm) for replacing pages on a page miss. When the program starts, none of these pages are in physical memory.
Which is the first page that leads to a page miss?
A
B
C
D
E
by Vivekanand Vellanki