1. Which of the following is/are the requirements of memory management.
i) Relocation ii) Protection iii) Sharing iv) Memory organization
A) i, ii and iii only
B) ii, iii and iv only
C) i, iii and iv only
D) All i, ii, iii and iv
2. The satisfaction of the relocation requirement increases the difficulty of satisfying the …………… requirement.
A) Protection
B) Sharing
C) Logical Organization
D) Physical Organization
3. 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.
A) memory relocation
B) memory protection
C) memory sharing
D) memory organization
4. Any ……………… mechanism must have the flexibility to allow several processes to access the same portion of main memory.
A) relocation
B) protection
C) sharing
D) organization
5. The memory management system must, therefore, allow controlled access to …………… areas of memory without compromising essential protection.
A) relocated
B) protected
C) shared
D) organized
6. Main memory in a computer system is ………………. as a linear or one dimensional, address space, consisting of a sequence of bytes or words.
A) relocated
B) protected
C) shared
D) organized
7. Which of the following are the advantages, if the operating system and computer hardware can effectively deal with user programs and data in the form of modules.
i) Modules can be written and compiled independently
ii) With modest additional overhead, different degrees of protection can be given to different modules
iii) It is possible to introduce mechanisms by which modules can be shared among processes
A) i and ii only
B) ii and iii only
C) i and iii only
D) All i, ii and iii
8. In almost all modern multiprogramming systems, the principal operation of memory management involves a sophisticated scheme known as ………………….
A) memory partitioning
B) virtual memory
C) real memory
D) memory organization
9. …………….. is based on the use of one or both of two basic techniques: segmentation and paging.
A) memory partitioning
B) virtual memory
C) real memory
D) memory organization
10. Which of the following is/are the different memory management techniques.
i) Fixed partitioning ii) Dynamic paging iii) Simple paging iv) Simple segmentation
A) i, ii and iii only
B) ii, iii and iv only
C) i, iii and iv only
D) All i, ii, iii and iv
11. Among all memory management techniques …………….. is simple to implement little operating system overhead.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
12. In …………… there is no internal fragmentation and is a more efficient use of main memory.
A) Fixed partitioning
B) Dynamic partitioning
C) Virtual memory paging
D) Simple segmentation
13. Having a small amount of internal fragmentation is the weakness of ……………. in memory management.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
14. Which of the following is/are the strengths of virtual memory segmentation techniques used in memory management.
i) No internal fragmentation
ii) A higher degree of multiprogramming
iii) More efficient to use of main memory
iv) Large virtual address space
v) Protection and sharing support
A) i, ii, iii and iv only
B) i, ii, iii and v only
C) i, ii, iv and v only
D) ii, iii, iv and v only
15. In …………………, there is an inefficient use of memory due to internal fragmentation.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
16. In ……………….., there is an inefficient use of processor due to the need for compaction to counter external fragmentation.
A) Fixed partitioning
B) Dynamic partitioning
C) Virtual memory paging
D) Simple segmentation
17. 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.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
18. In ……………….., there is an improved memory utilization and reduced overhead compared to dynamic partitioning.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
19. A process may be loaded into a partition of equal or greater size in ………………. of memory.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory paging
D) Simple segmentation
20. 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.
A) Fixed partitioning
B) Simple Paging
C) Virtual memory segmentation
D) Simple segmentation
Answers
1. A) i, ii and iii only
2. A) Protection
3. B) memory protection
4. C) sharing
5. C) shared
6. D) organized
7. D) All i, ii and iii
8. B) virtual memory
9. B) virtual memory
10. C) i, iii and iv only
11. A) Fixed partitioning
12. B) Dynamic partitioning
13. B) Simple Paging
14. C) i, ii, iv and v only
15. A) Fixed partitioning
16. B) Dynamic partitioning
17. D) Simple segmentation
18. D) Simple segmentation
19. A) Fixed partitioning
20. C) Virtual memory segmentation
Read Next: MCQ Questions On Memory Management In OS Part-2
