In this section of Operating System Main Memory – Memory Management.it contain Operating System Main Memory – Memory Allocation to a process using Heap MCQs (Multiple Choice Questions Answers).All the MCQs (Multiple Choice Question Answers) requires in detail reading of Operating System subject as the hardness level of MCQs have been kept to advance level.
This MCQs section is mainly focused on below lists of topics

1.Reuse of memory.
-Maintaining a free list.
-Performing fresh allocation by using a free lists.

  • First-Fit Technique
  • Best-Fit Technique
  • Next-Fit Technique

PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE

view hide answers

1. A Heap permits allocation and deallocation of memory in a ________ Manner.

  • Random and Sequential order
  • Sequential order
  • Random Order
  • None of the above

2. __________allocators are used by run-time support of programming language to manage PCD data,and by the kernel to manage its own memory requirements.

  • Stack
  • heap
  • stack and heap
  • None of the above

3. The speed of memory and efficient used of memory are two fundamental concerns in the design of memory allocator._______allocation addresses both these concerns effectively.

  • stack-based
  • heap-based
  • stack and heap based
  • None of the above

4. In _____ allocator released memory is not reused automatically when fresh allocation are made.

  • stack-based
  • heap-based
  • stack and heap based
  • None of the above

5. Some memory are is left over when a fresh allocation is made in ___ allocator.

  • stack-based
  • heap-based
  • stack and heap based
  • None of the above

6. Which of the below kernel functions can be used for reuse of memory in heap management?

  • Maintaining a free list.
  • select a memory area for allocation.
  • merge free memory area.
  • All of the above

7. which of the following control information the kernel needs to maintains for each memory area in the free list;

  • The size of the memory areas
  • the pointers used for forming the lists.
  • The size of the memory areas and the pointers used for forming the lists.
  • Stack pointer

8. Which of the following free lists is used to facilitate faster insertion and deletion operations on memory area while managing the free lists.

  • Singly linked free list.
  • Doubly linked free list
  • Stack
  • singly linked free list and stack

9. Which of the following techniques can be used  to perform memory allocation by using a free list;

  • First Fit technique
  • Best-Fit technique
  • Next-Fit technique
  • All of the above.

10. To service a request for n bytes of memory,the _____ technique uses the first free memory area it can find whose size is ≥ n bytes.

  • First Fit technique
  • Best-Fit technique
  • Next-Fit technique
  • Good-Fit technique.

11. The ____ technique uses the smallest free memory area with size ≥ n bytes.

  • First Fit technique
  • Best-Fit technique
  • Next-Fit technique
  • Good-Fit technique.

12. The _____ technique remembers which entry in the free list was used to make the last allocation.to make new allocation,it searches the free list starting from the next entry and perform allocation using first free memory area whose size  ≥ n bytes that it can find.

  • First Fit technique
  • Best-Fit technique
  • Next-Fit technique
  • Good-Fit technique.

13. ________ technique may split memory area at the start of the free list repeatedly,so free memory area become smaller with time.

  • First Fit
  • Best-Fit
  • Next-Fit
  • worst-Fit

14. ________ technique avoids needless splitting of large memory area.

  • First Fit
  • Best-Fit
  • Next-Fit
  • worst-Fit

15. ________ technique incurs higher allocation overhead

  • First Fit
  • Best-Fit
  • Next-Fit
  • worst-Fit

16. ________ technique avoids splitting the same free area repeatedly also avoids allocation overhead.

  • First Fit
  • Best-Fit
  • Next-Fit
  • worst-Fit
Share with : Share on Linkedin Share on Twitter Share on WhatsApp Share on Facebook