Testmoz
Home
Features
Pricing
FAQs
Build a Test
Login/Sign Up

Quiz II

Is this your test? Login to manage it. If not, you can create an assessment just like it.

This is a non-interactive preview of the quiz content.

1.
1 point
_________ is a technique using which a computer periodically collects all the deleted space onto the free storage list.
2.
1 point
In a circular linked list
3.
1 point
In the implementation of a simple linked list, each node carries information regarding
4.
1 point
In a _________ linked list,the last node link field points to the first node of the list.
5.
1 point
What would be the asymptotic time complexity to add an element in the linked list?
6.
1 point
The pointer in the last node of a simple linked list points to
7.
1 point
In a linked list,new data can be entered at
8.
1 point
Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
9.
1 point
A_______ linked list is a linked list structure in which each node has a pointer to both its successor and predecessor.
10.
1 point
In doubly linked lists, traversal can be performed?
11.
1 point
A variant of the linked list in which none of the node contains NULL pointer is?
12.
1 point
The operation of processing each element in the linked list is known as
Home Features Pricing FAQs Legal Sample Tests Build a Test Login/Sign Up