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?
z = startpoint;
while ((z < end) && \\ didn't reach end
(*z <= len)) \\ too small to satisfy request
{
assign this block
}A. code for first fit
B. code for best fit
C. code for worst fit
D. none of the mentioned
Answer: Option A
This Question Belongs to Data Structure >> Linked Lists In Data Structures
Join The Discussion