A. Smallest time value
B. Largest time value
C. Greatest size
D. None of the mentioned

A. Whenever a page is used, it is removed from the stack and put on bottom
B. The bottom of the stack is the lru page
C. The top of the stack contains the lru page and all new pages are added to the top
D. None of the mentioned

A. Queue algorithms
B. Stack algorithms
C. String algorithms
D. None of the mentioned

A. 2
B. 3
C. 4
D. 5

A. Virtual memory increases
B. Larger rams are faster
C. Fewer page faults occur
D. None of the mentioned

A. Virtual page number
B. Page frame number
C. Both virtual page number and page frame number
D. Access right information

A. The instruction set architecture
B. Page size
C. Physical memory size
D. Number of processes in memory

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

A. An actively used page should have a large reference count
B. A less used page has more chances to be used again
C. It is extremely efficient and optimal
D. All of the mentioned

A. They are too complicated
B. They are optimal
C. They are expensive
D. All of the mentioned