This set of Multiple Choice Questions (MCQs) covers advanced concepts of Operating System Memory Management, including page replacement algorithms, TLB, segmentation, and advanced memory techniques. Useful for GATE and IBPS IT Officer exams.
Topic: Operating System (Memory Management) | Set: 2
Difficulty: Medium to Hard | Total Questions: 15
Looking for basics?
Solve Memory Management MCQ Set 1 before attempting this advanced set.
Operating System Memory Management MCQs
Q1. Which page replacement algorithm suffers from Belady’s Anomaly?
A. LRU
B. Optimal
C. FIFO
D. LFU
View Answer & Explanation
Answer: C
Explanation: Belady’s Anomaly occurs in FIFO where more frames can increase page faults.
Q2. The “Working Set” of a process is:
A. Program size
B. Pages in cache
C. Actively used pages
D. Frames allocated
View Answer & Explanation
Answer: C
Explanation: It represents the pages actively used to avoid frequent page faults.
Q3. Thrashing is defined as:
A. Fast execution
B. Excessive paging
C. Disk failure
D. Data conflict
View Answer & Explanation
Answer: B
Explanation: OS spends more time swapping pages than executing.
Q4. Translation Lookaside Buffer (TLB) is used to:
A. Store data
B. Speed up address translation
C. Disk I/O
D. Arithmetic
View Answer & Explanation
Answer: B
Explanation: TLB caches page table entries for faster lookup.
Q5. Which bit indicates a modified page?
A. Valid bit
B. Protection bit
C. Dirty bit
D. Reference bit
View Answer & Explanation
Answer: C
Explanation: Dirty bit shows if page must be written back to disk.
Q6. 32-bit address & 4 KB page → offset bits?
A. 10
B. 12
C. 20
D. 32
View Answer & Explanation
Answer: B
Explanation: 4 KB = 2¹² → 12-bit offset.
Q7. In Clock algorithm, reference bit = 1 means:
A. Replace immediately
B. Give second chance
C. Write to disk
D. Terminate
View Answer & Explanation
Answer: B
Explanation: Bit reset and page gets another chance.
Q8. Worst-fit disadvantage:
A. Slow
B. Small holes
C. Leaves large holes
D. Only internal fragmentation
View Answer & Explanation
Answer: C
Explanation: Large holes may not be used efficiently.
Q9. Segmentation differs because:
A. Fixed size
B. Visible to programmer
C. Causes no fragmentation
D. Hardware only
View Answer & Explanation
Answer: B
Explanation: Segments represent logical units visible to programmer.
Q10. Global replacement means:
A. Own frames only
B. Can take frames from others
C. Replace all pages
D. Delete page table
View Answer & Explanation
Answer: B
Explanation: Frames can be taken from other processes.
Q11. Invalid bit means:
A. Corrupted
B. Not in memory/space
C. No write
D. Kernel mode
View Answer & Explanation
Answer: B
Explanation: Triggers page fault.
Q12. Exact LRU implementation uses:
A. Single bit
B. Stack/counters
C. Random
D. FIFO
View Answer & Explanation
Answer: B
Explanation: Needs tracking of usage order.
Q13. 2-level paging divides address into:
A. Page + Offset
B. Outer + Inner + Offset
C. Segment + Page
D. Base + Limit
View Answer & Explanation
Answer: B
Explanation: Multi-level indexing reduces large tables.
Q14. Copy-on-Write is used in:
A. Shutdown
B. Fork
C. Format
D. Deadlock
View Answer & Explanation
Answer: B
Explanation: Pages copied only when modified.
Q15. Optimal algorithm is:
A. Used in OS
B. Easy
C. Benchmark
D. Past-basedView Answer & Explanation
View Answer & Explanation
Answer: C
Explanation: Uses future knowledge, so only theoretical.
Conclusion
These Operating System Memory Management MCQ Questions help strengthen understanding of memory management techniques, fragmentation, paging and other important concepts . Practice regularly for IBPS IT Officer and GATE exams.
For detailed theory, refer to Operating System Memory Management .