The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.

Related MCQs

• Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• Which of the following conditions checks available free space in avail list?
• The special list which consists of unused memory space is called __________.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
• When elements are deleted the nodes go to_________.
• In ……………, search start at the beginning of the list and check every element in the list.
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?