455 views
1 votes
1 votes
Assume that a memory with only 4 pages,each of 16 bytes,is initially empty.The CPU generates the following sequence of virtual addresses and uses the LRU page replacement policy.

0,4,8,20,24,36,44,12,68,72,80,84,28,32,88,92

How many page faults does this sequence cause?What are the page number of the pages present in the main memory at the end of sequence?

A)6 and 1,2,3,4 .               B)7 and 1,2,4,5

C)8 and 1,2,4,5 .               D)9 and 1,2,3,5

1 Answer

Related questions

2 votes
2 votes
1 answer
1
Avik Chowdhury asked Jul 10, 2018
1,232 views
The number of page faults with a given string "S " using LRU algorithm is "N" and considering the reverse of string S^R the number of page faults will beA)N. ...
0 votes
0 votes
0 answers
2
pream sagar asked Jan 23, 2019
662 views
Consider the system which has virtual address of 36 bits and physical address of 30 bits and page size of 8KB, page table entry contain 1 valid bit, 2 protection bit and ...
0 votes
0 votes
1 answer
3
aambazinga asked Jan 8, 2019
635 views
TRUE/FALSE:statement 1: secondary index may or may not be dense.statement 2: disk is considered as the maximum size of virtual memory.
0 votes
0 votes
1 answer
4
Vivekk asked Oct 30, 2018
589 views
Please explain the solution to this question