Data Structure Questions and Answers-Free List

YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

CLICK HERE TO DOWNLOAD

Data Structure Questions and Answers-Free List

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Free lists are used in
A
static memory allocation
B
dynamic memory allocation
C
contagious allocations
D
are used for speeding up linked list operations
Question 1 Explanation: 
Their property is meant for dynamic allocations.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What are implicit and explicit implementations of freelists?
A
garbage collection and new or malloc operators respectively
B
new or malloc and garbage collection respectively
C
implicit implementation is not favored
D
explicit implementation is not favored
Question 2 Explanation: 
Gc and new most widely known.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What datastructures can be used in implementing a free list?
A
only linked list
B
linked list or sort trees
C
arrays
D
trees
Question 3 Explanation: 
Sort trees can also be used in impelementing free lists which remaincomplex.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What are different ways of implementing free lists and which is simple among them?
A
best fit, first fit, worst fit, simple-first fit
B
best fit, first fit, worst fit, simple-best fit
C
best fit, first fit, worst fit, simple-worst fit
D
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.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is buddy memory management of free lists?
A
modified version of first fit
B
buddy allocation keeps several free lists, each one holds blocks which are of one particular size
C
modified version of best fit
D
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.