Vidyalelo
Data Structure · Q52

Linked Lists in Data Structures

Programming · Data Structure · question 52

Q52

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?

A.
code for first fit
Answer
B.
code for best fit
C.
code for worst fit
D.
none of the mentioned

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board