Operating system mcqs virtual memory page replacement algorithms

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Operating system mcqs virtual memory page replacement algorithms

Question 16 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
For 3 page frames, the following is the reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1 How many page faults does the LRU page replacement algorithm produce?
A
10
B
15
C
11
D
12
Question 17 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Increasing the RAM of a computer typically improves performance because .....
A
Virtual memory increases
B
Larger RAMs are faster
C
Fewer page faults occur
D
None of the mentioned
Question 18 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
When using counters to implement LRU, we replace the page with the .....
A
smallest time value
B
largest time value
C
greatest size
D
none of the mentioned
Question 18 Explanation: 
Whenever a reference to a page is made, the contents of the clock register are copied into the time-of-use field in the page-table entry for that page. In this way, we always have the time of the last reference to each page.
Question 19 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Optimal page - replacement algorithm is difficult to implement, because .....
A
it requires a lot of information
B
it requires future knowledge of the reference string
C
it is too complex
D
it is extremely expensive
Question 20 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
In question 2, if the number of page frames is increased to 4, then the number of page transfers .....
A
decreases
B
increases
C
remains the same
D
none of the mentioned
There are 20 questions to complete.