Q. A circular linked list can be used for

View solution

Q. In doubly linked lists

View solution

Q. ………… is very useful in situation when data have to stored and then retrieved in reverse order.

View solution

Q. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.

View solution

Q. There is an extra element at the head of the list called a ……….

View solution

Q. Each node in a linked list has two pairs of ………….. and ……………….

View solution

Q. The disadvantage in using a circular linked list is …………………….

View solution

Q. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as

View solution

Q. Linked lists are best suited

View solution

Q. The situation when in a linked list START=NULL is

View solution

Q. Which of the following is two way list?

View solution

Q. In a circular linked list

View solution

Q. A linear collection of data elements where the linear node is given by means of pointer is called?

View solution

Q. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

View solution

Q. 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?

View solution

Q. A variant of linked list in which last node of the list points to the first node of the list is?

View solution

Q. In doubly linked lists, traversal can be performed?

View solution

Q. What kind of linked list is best to answer question like “What is the item at position n?”

View solution

Q. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

View solution

Q. A variant of the linked list in which none of the node contains NULL pointer is?

View solution