Memory Management MCQ Multiple Choice Questions Answers for Practice

Q: 1. .............. is based on the use of one or both of two basic techniques: segmentation and paging.

Correct Answer is: virtual memory

Q: 3. A process may be loaded into a partition of equal or greater size in .............. of memory.

Correct Answer is: Fixed partitioning

Q: 4. Among all memory management techniques .............. is simple to implement little operating system overhead.

Correct Answer is: Fixed partitioning

Q: 6. CPU fetches the instruction from memory according to the value of

Correct Answer is: program counter

Q: 7. Having a small amount of internal fragmentation is the weakness of .............. in memory management.

Correct Answer is: Simple Paging

Q: 8. In .............. , there is a improved memory utilization and reduced overhead compared to dynamic partitioning.

Correct Answer is: Simple segmentation

Q: 9. In .............. , there is a inefficient use of memory due to internal fragmentation.

Correct Answer is: Fixed partitioning

Q: 10. In .............. , there is a inefficient use of processor due to the need for compaction to counter external fragmentation.

Correct Answer is: Dynamic partitioning

Q: 11. In .............. , there is not necessary to load all of the segments of a process and non resident segments that are needed are brought in later automatically.

Correct Answer is: Virtual memory segmentation

Q: 12. In .............. technique, each process is divided into a number of segments and process loaded by loading all of its segments into dynamic partitions that need not be contiguous.

Correct Answer is: Simple segmentation

1. .............. is based on the use of one or both of two basic techniques: segmentation and paging.

memory partitioning
virtual memory
real memory
memory organization

2. A memory buffer used to accommodate a speed differential is called

stack pointer
cache
accumulator
disk buffer

3. A process may be loaded into a partition of equal or greater size in .............. of memory.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

4. Among all memory management techniques .............. is simple to implement little operating system overhead.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

5. Any .............. mechanism must have the flexibility to allow several processes to access the same portion of main memory.

relocation
protection
sharing
organization

6. CPU fetches the instruction from memory according to the value of

program counter
status register
instruction register
program status word

7. Having a small amount of internal fragmentation is the weakness of .............. in memory management.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

8. In .............. , there is a improved memory utilization and reduced overhead compared to dynamic partitioning.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

9. In .............. , there is a inefficient use of memory due to internal fragmentation.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

10. In .............. , there is a inefficient use of processor due to the need for compaction to counter external fragmentation.

Fixed partitioning
Dynamic partitioning
Virtual memory paging
Simple segmentation

11. In .............. , there is not necessary to load all of the segments of a process and non resident segments that are needed are brought in later automatically.

Fixed partitioning
Simple Paging
Virtual memory segmentation
Simple segmentation

12. In .............. technique, each process is divided into a number of segments and process loaded by loading all of its segments into dynamic partitions that need not be contiguous.

Fixed partitioning
Simple Paging
Virtual memory paging
Simple segmentation

13. In .............. there is no internal fragmentation and is more efficient use of main memory.

Fixed partitioning
Dynamic partitioning
Virtual memory paging
Simple segmentation

14. In almost all modern multi programming systems, principal operation of memory management involves a sophisticated scheme known as ..............

memory partitioning
virtual memory
real memory
memory organization

15. Increasing the RAM of a computer typically improves performance because:

Virtual memory increases
Larger RAMs are faster
Fewer page faults occur
Fewer segmentation faults occur

16. Main memory in a computer system is .............. as a linear or one dimensional, address space, consisting of a sequence of bytes or words.

relocated
protected
shared
organized

17. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

fragmentation
paging
mapping
none of the mentioned

18. Operating System maintains the page table for

each process
each thread
each instruction
each address

19. Page fault occurs when

When a requested page is in memory
When a requested page is not in memory
When a page is currupted
When an exception is thrown

20. Program always deals with

logical address
absolute address
physical address
relative address

21. Run time mapping from virtual to physical address is done by

Memory management unit
CPU
PCI
None of the mentioned

22. Satisfaction of the relocation requirement increases the difficulty or satisfying the ......... requirement.

Protection
Sharing
Logical Organization
Physical Organization

23. The .............. requirement must be satisfied by the processor rather than the operating system, because the operating system cannot anticipate all of the memory references that the program will make.

memory relocation
memory protection
memory sharing
memory organization

24. The address of a page table in memory is pointed by

stack pointer
page table base register
page register
program counter

25. The memory management system must therefore allow controlled access to .............. areas of memory without compromising essential protection.

relocated
protected
shared
organized

26. The page table contains

base address of each page in physical memory
page offset
page size
none of the mentioned

27. Thrashing occurs when

When a page fault occurs
Processes on system frequently access pages not memory
Processes on system are in running state
Processes on system are in waiting state

28. Virtual memory is

Large secondary memory
Large main memory
Illusion of large main memory
None of the above

29. What is compaction?

a technique for overcoming internal fragmentation
a paging technique
a technique for overcoming external fragmentation
a technique for overcoming fatal error

30. What is the swap space in the disk used for?

Saving temporary html pages
Saving process data
Storing the super-block
Storing device drivers

Memory Management MCQs are essential for students and exam aspirants looking to strengthen their understanding of how computer systems manage memory. These questions cover a range of topics and are perfect for anyone preparing for exams, interviews, or concept revision.

About Memory Management MCQ Questions

Memory Management is a crucial aspect of computer science that deals with the allocation and deallocation of memory resources. Key concepts include virtual memory, paging, segmentation, and memory allocation techniques. These MCQs cover everything from basic definitions to advanced problem-solving scenarios, ensuring a comprehensive understanding of the subject.

Why Practice Memory Management Objective Questions?

Practicing Memory Management MCQs offers several benefits. They help students and professionals prepare for school and college exams, competitive exams, and technical interviews. Regular practice enhances your problem-solving skills, improves recall, and reinforces your knowledge of fundamental and advanced concepts. This preparation can significantly boost your confidence and performance in both academic and professional settings.

Who Should Use These MCQs?

Students preparing for school or college exams
Competitive exam aspirants
Candidates preparing for interviews

Memory Management MCQ Multiple Choice Questions Answers for Practice

1. .............. is based on the use of one or both of two basic techniques: segmentation and paging.

2. A memory buffer used to accommodate a speed differential is called

3. A process may be loaded into a partition of equal or greater size in .............. of memory.

4. Among all memory management techniques .............. is simple to implement little operating system overhead.

5. Any .............. mechanism must have the flexibility to allow several processes to access the same portion of main memory.

6. CPU fetches the instruction from memory according to the value of

7. Having a small amount of internal fragmentation is the weakness of .............. in memory management.

8. In .............. , there is a improved memory utilization and reduced overhead compared to dynamic partitioning.

9. In .............. , there is a inefficient use of memory due to internal fragmentation.

10. In .............. , there is a inefficient use of processor due to the need for compaction to counter external fragmentation.

11. In .............. , there is not necessary to load all of the segments of a process and non resident segments that are needed are brought in later automatically.

12. In .............. technique, each process is divided into a number of segments and process loaded by loading all of its segments into dynamic partitions that need not be contiguous.

13. In .............. there is no internal fragmentation and is more efficient use of main memory.

14. In almost all modern multi programming systems, principal operation of memory management involves a sophisticated scheme known as ..............

15. Increasing the RAM of a computer typically improves performance because:

16. Main memory in a computer system is .............. as a linear or one dimensional, address space, consisting of a sequence of bytes or words.

17. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

18. Operating System maintains the page table for

19. Page fault occurs when

20. Program always deals with

21. Run time mapping from virtual to physical address is done by

22. Satisfaction of the relocation requirement increases the difficulty or satisfying the ......... requirement.

23. The .............. requirement must be satisfied by the processor rather than the operating system, because the operating system cannot anticipate all of the memory references that the program will make.

24. The address of a page table in memory is pointed by

25. The memory management system must therefore allow controlled access to .............. areas of memory without compromising essential protection.

26. The page table contains

27. Thrashing occurs when

28. Virtual memory is

29. What is compaction?

30. What is the swap space in the disk used for?

About Memory Management MCQ Questions

Why Practice Memory Management Objective Questions?

Who Should Use These MCQs?

Login at Quizforum