Memory Management MCQs Quiz Multiple Choice Questions & Answers

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

1. memory partitioning
2. virtual memory
3. real memory
4. memory organization

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

1. stack pointer
2. cache
3. accumulator
4. disk buffer

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

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. relocation
2. protection
3. sharing
4. organization

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

1. program counter
2. status register
3. instruction register
4. program status word

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

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. Fixed partitioning
2. Dynamic partitioning
3. Virtual memory paging
4. 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.

1. Fixed partitioning
2. Simple Paging
3. Virtual memory segmentation
4. 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.

1. Fixed partitioning
2. Simple Paging
3. Virtual memory paging
4. Simple segmentation

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

1. Fixed partitioning
2. Dynamic partitioning
3. Virtual memory paging
4. Simple segmentation

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

1. memory partitioning
2. virtual memory
3. real memory
4. memory organization

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

1. Virtual memory increases
2. Larger RAMs are faster
3. Fewer page faults occur
4. 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.

1. relocated
2. protected
3. shared
4. organized

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

1. fragmentation
2. paging
3. mapping
4. none of the mentioned

18. Operating System maintains the page table for

1. each process
2. each thread
3. each instruction
4. each address

19. Page fault occurs when

1. When a requested page is in memory
2. When a requested page is not in memory
3. When a page is currupted
4. When an exception is thrown

20. Program always deals with

1. logical address
2. absolute address
3. physical address
4. relative address

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

1. Memory management unit
2. CPU
3. PCI
4. None of the mentioned

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

1. Protection
2. Sharing
3. Logical Organization
4. 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.

1. memory relocation
2. memory protection
3. memory sharing
4. memory organization

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

1. stack pointer
2. page table base register
3. page register
4. program counter

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

1. relocated
2. protected
3. shared
4. organized

26. The page table contains

1. base address of each page in physical memory
2. page offset
3. page size
4. none of the mentioned

27. Thrashing occurs when

1. When a page fault occurs
2. Processes on system frequently access pages not memory
3. Processes on system are in running state
4. Processes on system are in waiting state

28. Virtual memory is

1. Large secondary memory
2. Large main memory
3. Illusion of large main memory
4. None of the above

29. What is compaction?

1. a technique for overcoming internal fragmentation
2. a paging technique
3. a technique for overcoming external fragmentation
4. a technique for overcoming fatal error

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

1. Saving temporary html pages
2. Saving process data
3. Storing the super-block
4. Storing device drivers

31. Which of the following page replacement algorithms suffers from Beladys anomaly?

1. FIFO
2. LRU
3. Optimal Page Replacement
4. Both LRU and FIFO

32. Which one of the following is the address generated by CPU?

1. physical address
2. absolute address
3. logical address
4. none of the mentioned