Binary Tree Test - 2

1. What is buddy memory management of free lists ?

a tree representation of free lists

buddy allocation keeps several‭ ‬free lists,‭ ‬each one holds blocks which are of one particular size

modified version of best fit

modified version of first fit

2. What are implicit and explicit implementations of freelists?

explicit implementation is not favored

garbage collection and new or malloc operators respectively

new or malloc and garbage collection respectively

implicit implementation is not favored

3. What are different ways of implementing free lists and which is simple among them?

best fit, first fit, worst fit, simple-best fit

best fit simple-best fit

best fit, first fit, worst fit, simple-first fit

best fit, first fit, worst fit, simple-worst fit

4. How are free blocks linked together mostly and in what addressing order?

none of the mentioned

circular linked list and increasing addressing order

linked list and in no addressing order

linked list and decreasing addressing order

5. What are the disadvantages in implementing buddy system algorithm for free lists?

it takes so much space

we no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole

internal fragmentation

both a and c are correct

6. How does implicit free lists(garbage collection) works in adding memory to free list ?

makes a probabilistic guess

whichever comes last will be added to free list

certain blocks cannot be used if there are no pointers to them and hence they can be freed

whichever comes first will be added to free list

7. Free lists are used in

static memory allocation

contagious allocations

dynamic memory allocation

are used for speeding up linked list operations

8. What datastructures can be used in implementing a free list?

only linked list

arrays

linked list or sort trees

trees

9. Accessing free list very frequently for wide range of addresses can lead to

memory errors

cache problems

paging

segmentation fault

10. Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0.

 z = startpoint;
 while ((z < end) &&    \\ didn't reach end
   (*z <= len))          \\ too small to satisfy request
 {           
   assign this block
 }

The above code represents what?

code for first fit

code for best fit

code for worst fit

none of the mentioned