# UGCNET-Oct2020-II: 15

35 views

Consider a hypothetical machine with $3$ pages of physical memory, $5$ pages of virtual memory, and $<A, B, C, D, A, B, E, A, B, C, D, E, B, A, B>$ as the stream of page reference by an application. If $P$ and $Q$ are the number of page faults that the application would incur with FIFO and LRU page replacement algorithms respectively, then $(P,Q)=$ _______(Assuming enough space for storing $3$ page frames)

1. $(11,10)$
2. $(12,11)$
3. $(10,11)$
4. $(11,12)$

recategorized

3 pages of physical memory means 3 frames (so at a time only max 3 page in  frames)

5 pages of  virtual memory means 5 page

A B C D A B  E A B C D E B A B

FIFO  Page Fault  for  A ,B ,C ,D  ,A ,B ,E, C ,D ,B,A   TOTAL= 11

LRU   Page Fault  for  A ,B ,C ,D  ,A ,B ,E, C ,D ,E,B,A   TOTAL= 12

Option 4 is the right ans

## Related questions

1
20 views
Consider a disk system having $60$ cylinders. Disk requests are received by a disk drive for cylinders $10,22,20,2,40,6$ and $38$, in that order. Assuming the disk head is currently at cylinder $20$, what is the time taken to satisfy all the ... cylinder to adjacent one and Shortest Seek Time First (SSTF) algorithm is used? $240$ milliseconds $96$ milliseconds $120$ milliseconds $112$ milliseconds
2
19 views
Suppose you have a Linux file system where the block size is $2K$ bytes, a disk address is $32$ bits, and an $i-$node contains the disk addresses of the first $12$ direct blocks of file, a single indirect block and a double indirect block. Approximately, what is the largest file that can be represented by an $i-$node? $513$ Kbytes $513$ MBytes $537$ Mbytes $537$ KBytes
3
22 views
Consider a single-level page table system, with the page table stored in the memory. If the hit rate to TLB is $80\%$, and it takes $15$ nanoseconds to search the $TLB$, and $150$ nanoseconds to access the main memory, then what is the effective memory access time, in nanoseconds? $185$ $195$ $205$ $175$
Match $\text{List I}$ with $\text{List II}$ ... C-III, D-IVA-II, B-IV, C-III, D-IA-II, B-IV, C-I, D-IIIA-IV, B-III, C-II, D-I$Match$