Home > Computer Engineering > Quizzes > Operating Systems: Memory Management
Operating Systems: Memory Management
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 23% • Most missed: “A memory page containing a heavily used variable that was initialized very early…”
Operating Systems: Memory Management
Time left 00:00
25 Questions

1. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________
2. What is the advantage of dynamic loading?
3. The relocation register helps in ____________
4. A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements.P : Increasing the number of page frames allocated to a process sometimes increases the page fault rateQ : Some programs do not exhibit locality of reference. Which of the following is TRUE?
5. Increasing the RAM of a computer typically improves performance because ____________
6. If relocation is static and is done at assembly or load time, compaction _________
7. Which one of the following is the address generated by CPU?
8. If the process can be moved during its execution from one memory segment to another, then binding must be ____________
9. In the stack implementation of the LRU algorithm, a stack can be maintained in a manner ____________
10. The address generated by the CPU is referred to as ____________
11. In a system that does not support swapping ____________
12. With relocation and limit registers, each logical address must be _______ the limit register.
13. Binding of instructions and data to memory addresses can be done at ____________
14. A solution to the problem of external fragmentation is ____________
15. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is?
16. What is Address Binding?
17. In segmentation, each address is specified by ____________
18. The ___________ swaps processes in and out of the memory.
19. In contiguous memory allocation ____________
20. There is a set of page replacement algorithms that can never exhibit Belady's Anomaly, called ____________
21. The run time mapping from virtual to physical addresses is done by a hardware device called the ____________
22. Which of the following is TRUE?
23. Logical memory is broken into blocks of the same size called _________
24. The ___________ must design and program the overlay structure.
25. The main memory accommodates ____________

⚡ Recently practiced quizzes in this topic
Live quiz activity
Information Technology Knowledge Test Computer Network MCQs General CS (Computer Science) Knowledge Test Big Data: NoSQL Green Computing Practice Test Natural Language Processing: Word Level Analysis Computational Thinking Concepts Computer Fundamentals Practice Test Operating Systems Practice Test: Introduction to OS Computer Fundamentals Practice Test: Generations of Computers
 
❤ If you liked Fatskills, consider supporting us by checking out The Life Manuals You Never Got.

🌈  Our mission is to help improve your scores in any subject and exam withonline quizzes, practice tests, study guides, & advice for students. Since 2018.
About | Explore | User Guide | Topics | Subjects | Doubt Solver | Career Aptitude Test | Answers | Free Tools | OSHA Basics Quiz | What Should We Know?
Privacy | Terms |
Without work one finishes nothing. - Ralph Waldo Emerson
© 2026 Fatskills.com

All trademarks, logos and brand names are the property of their respective owners. All company, product and service names used in this website are for identification purposes only. Use of these names, trademarks and brands does not imply endorsement.