Operating System MCQ - Virtual Memory
Virtual Memory MCQs : This section focuses on "Virtual Memory" in Operating System. These Multiple Choice Questions (MCQ) should be practiced to improve the Operating System skills required for various interviews (campus interview, walk-in interview, company interview), placements, entrance exams and other competitive examinations.
1. A computer can address more memory than the amount physically installed on the system. This extra memory is actually called ______________.
A. Virtual Memory
B. Physical Memory
C. Logical Memory
D. Secondary Memory
View Answer
Ans : A
Explanation: A computer can address more memory than the amount physically installed on the system. This extra memory is actually called virtual memory
2. MMU stands for?
A. memory mapping unit
B. memory management unit
C. main memory unit
D. None of the above
View Answer
Ans : B
Explanation: MMU stands for memory management unit.
3. While executing a program, if the program references a page which is not available in the main memory then it is known as?
A. Demand Paging
B. Frame Fault
C. page fault
D. processor fault
View Answer
Ans : C
Explanation: While executing a program, if the program references a page which is not available in the main memory because it was swapped out a little ago, the processor treats this invalid memory reference as a page fault.
4. Which of the following are the advantage of Demand Paging?
A. Large virtual memory.
B. More efficient use of memory.
C. There is no limit on degree of multiprogramming.
D. All of the above
View Answer
Ans : D
Explanation: Following are the advantages of Demand Paging : Large virtual memory, More efficient use of memory, There is no limit on degree of multiprogramming.
5. The string of memory references is ?
A. Page Replacement
B. Reference String
C. Memory References
D. Page References
View Answer
Ans : B
Explanation: The string of memory references is called reference string. Reference strings are generated artificially or by tracing a given system and recording the address of each memory reference.
6. consider the following sequence of addresses : 123,215,600,1234,76,96. If page size is 100, then the reference string is?
A. 1,2,6,12
B. 12,21,60,123,7,9
C. 1,2,6,12,0,0
D. 0,2,6,12,0,0
View Answer
Ans : C
Explanation: If page size is 100, then the reference string is 1,2,6,12,0,0
7. Which algorithm is based on the argument that the page with the smallest count?
A. Least frequently Used
B. Page Buffering algorithm
C. Most frequently Used
D. Least Recently Used
View Answer
Ans : C
Explanation: Most frequently Used(MFU) algorithm :This algorithm is based on the argument that the page with the smallest count was probably just brought in and has yet to be used.
8. Swap space exists in ____________
A. Primary Memory
B. secondary memory
C. virtual memory
D. CPU
View Answer
Ans : B
Explanation: Swap space exists in secondary memory.
9. In FIFO, ______ in main memory is the one which will be selected for replacement.
A. oldest page
B. newest page
C. random page
D. None of the above
View Answer
Ans : A
Explanation: First In First Out (FIFO) algorithm : Oldest page in main memory is the one which will be selected for replacement.
10. A process is thrashing if ____________
A. it is spending more time paging than executing
B. it is spending less time paging than executing
C. page fault occurs
D. swapping can not take place
View Answer
Ans : A
Explanation: A process is thrashing if it is spending more time paging than executing.
Discussion