Which of the following page replacement policy replaces the page whose time since last reference is greater
a) FIFO
b) Optimal page replacement
c) LRU replacement
d) Counting based replacement
Which of the following associates “page reference bit” with each frame?
a) LRU
b) NRU
c) URN
d) UNR
Explanation: NRU stand for not recently used
What is the value of reference page, when page is accessed?
a) 0
b) 1
c) 2
d) none of these
Which of the following formula id=s used for equal frame?
a) n/m
b) m/n
c) n%m
d) m%n
Explanation: m shows available frames, n shows processes
When processor spend its most of time in swapping pages and doing productive work is called?
a) thrashing
b) working set
c) frames
d) not recent used
How many numbers of pages required in thrashing?
a) maximum
b) minimum
c) medium
d) all of these
