Question: Which of the following statements stands true for memory compaction method. <ol> <li>it involves movement of code and data in the memory.</li> <li>it is feasible only if computer system provides relocation register;the relocation can be achieved by simply changing the address in the relocation register</li> <li>it does not involves movement of code and data in the memory</li> <li>it does not involves use of relocation register</li> </ol>
Answer:
Memory compaction is not simple as suggested.it involves movement of code and data in memoryin free list if process memory has free memory on either side of it.it needs to be relocated to execute correctly from the new memory area allocated to it.Relocation involves modification of all addresses used by a process,including address of heap-allocated data and address contained in the general purppose registers.it is feasible only if the computer system provides a relocation register;relocation can be achieved by simply changing the address in the relocation register.
MCQ: Which of the following statements stands true for memory compaction method. <ol> <li>it involves movement of code and data in the memory.</li> <li>it is feasible only if computer system provides relocation register;the relocation can be achieved by simply changing the address in the relocation register</li> <li>it does not involves movement of code and data in the memory</li> <li>it does not involves use of relocation register</li> </ol>
Explanation:
Memory compaction is not simple as suggested.it involves movement of code and data in memoryin free list if process memory has free memory on either side of it.it needs to be relocated to execute correctly from the new memory area allocated to it.Relocation involves modification of all addresses used by a process,including address of heap-allocated data and address contained in the general purppose registers.it is feasible only if the computer system provides a relocation register;relocation can be achieved by simply changing the address in the relocation register.
Discuss a Question
Related Questions
- 1. Buddy system and power of 2 allocators leads to ___________
- 2. In the Binary buddy system the sizes of memory blocks are ___________ and separate free lists are maintained for blocks of ___________sizes.
- 3. Which of the following statement is true for buddy system allocators? <ol> <li>Buddy System splits and recombines memory blocks in a predetermined manner during allocation and deallocation.</li> <li>No splitting of blocks takes place, also no effort is made to coalesce adjoining blocks to form larger blocks; when released, a block is simply returned to its free list.</li> <li> When a request is made for m bytes, the allocator first check the free list containing blocks whose size is 2<sup>i</sup> for the smallest value of i such that 2<sup>i</sup> ≥ m.if the free list is empty ,it checks the list containing blocks that are higher the next higher power of 2 in size on so on. an entire block is allocated to a request.</li> <li> When a request is made for m bytes. the system finds the smallest power of 2 that is ≥ m. Let this be 2<sup>i</sup>.if the list is empty, it checks the lists for block of size 2<sup>i+1</sup>.it takes one block off this list and splits it into two halves of size 2<sup>i</sup>.it put one of these blocks into the free list of size 2<sup>i</sup>,and uses the other block to satisfy the request.</li> </ol>
- 4. Which of the following statement is true for Power-of-2 allocators? <ol> <li>Buddy System splits and recombines memory blocks in a predetermined manner during allocation and deallocation.</li> <li>No splitting of blocks takes place, also no effort is made to coalesce adjoining blocks to form larger blocks; when released, a block is simply returned to its free list.</li> <li> When a request is made for m bytes, the allocator first check the free list containing blocks whose size is 2<sup>i</sup> for the smallest value of i such that 2<sup>i</sup> ≥ m.if the free list is empty ,it checks the list containing blocks that are higher the next higher power of 2 in size on so on. an entire block is allocated to a request.</li> <li> When a request is made for m bytes. the system finds the smallest power of 2 that is ≥ m. Let this be 2<sup>i</sup>.if the list is empty, it checks the lists for block of size 2<sup>i+1</sup>.it takes one block off this list and splits it into two halves of size 2<sup>i</sup>.it put one of these blocks into the free list of size 2<sup>i</sup>,and uses the other block to satisfy the request.</li> </ol>
- 5. The buddy and power of 2 allocators are faster than the first-fit ,best-fit, next-fit allocators
- 6. The power of 2 allocators is faster than the Buddy System allocators.
- 7. Contiguous memory allocation is the classical memory allocation model in which
- 8. Contiguous memory allocation faces the problem of
- 9. In Contiguous memory allocation _________ has no cure
- 10. The technique of memory compaction and reuse of memory can be applied to overcome the problem of
You may be interested in:
OS Memory Management MCQsRecently Added Articles
How Do Java Development Teams Use Docker and Kubernetes to Deploy Applications?
Last updated on: April 24, 2026Posted by: ExamRadar
AI vs Machine Learning: Key Differences Every Professional Should Know
Last updated on: February 13, 2026Posted by: ExamRadar
Office Cleaning Services That Elevate Sydney Offices
Last updated on: February 11, 2026Posted by: ExamRadar
What You Actually Learn About Exam Patterns From RBI Grade B Previous Year Papers?
Last updated on: February 9, 2026Posted by: ExamRadar
Mental Health Support That’s Closer Than You Think
Last updated on: January 7, 2026Posted by: ExamRadar
Transform Your Home’s Exterior with Columbus roofing company
Last updated on: November 27, 2025Posted by: ExamRadar
