Data Structure Questions and Answers-Free List
Click on any option to know the CORRECT ANSWERS
Free lists are used in
static memory allocation
dynamic memory allocation
are used for speeding up linked list operations
Question 1 Explanation:
Their property is meant for dynamic allocations.
What are implicit and explicit implementations of freelists?
garbage collection and new or malloc operators respectively
new or malloc and garbage collection respectively
implicit implementation is not favored
explicit implementation is not favored
Question 2 Explanation:
Gc and new most widely known.
What datastructures can be used in implementing a free list?
only linked list
linked list or sort trees
Question 3 Explanation:
Sort trees can also be used in impelementing free lists which remaincomplex.
What are different ways of implementing free lists and which is simple among them?
best fit, first fit, worst fit, simple-first fit
best fit, first fit, worst fit, simple-best fit
best fit, first fit, worst fit, simple-worst fit
best fit simple-best fit
Question 4 Explanation:
The simplest form of memory management system can be called as first-fit. a device or system maintains a single list of free memory locations. When request to memory is sent, the list is searched and the first block that is large enough is returned.
What is buddy memory management of free lists?
modified version of first fit
buddy allocation keeps several free lists, each one holds blocks which are of one particular size
modified version of best fit
a tree representation of free lists
Question 5 Explanation:
When an allocation request is received, the list that holds blocks that are just large enough to satisfy the request are considered, and an open location is returned. If no free blocks that are smaller than two times the size that are requested are available, a larger block is split in two to satisfy the requirements.
There are 5 questions to complete.