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
What is the time complexity of inserting an element at the beginning of a linked list?
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Which of the following is a disadvantage of linked lists compared to arrays?
A. Dynamic size
B. Random access
C. Ease of insertion and deletion
D. Memory overhead
What is a circular linked list?
A. A list where each node points to the next
B. A list where the last node points to the first node
C. A list where each node points to itself
D. A list where the nodes are in a circle
Which of the following is true about a doubly linked list?
A. Each node has one pointer
B. Each node has two pointers
C. It is a type of tree
D. It can be traversed in one direction only
Join The Discussion