91. | What is a memory efficient double linked list? |
Answer: (a).Each node has only one pointer to traverse the list back and forth
|
92. | Which of the following piece of code removes the node from a given position?
|
Answer: (a).a
|
93. | How do you calculate the pointer difference in a memory efficient double linked list? |
Answer: (b).pointer to previous node xor pointer to next node
|
94. | What is the time complexity of inserting a node in a doubly linked list? |
Answer: (c).O(n)
|
95. | How do you insert a node at the beginning of the list?
|
Answer: (a).a
|
96. | Consider the following doubly linked list: head-1-2-3-4-5-tail What will be the list after performing the given sequence of operations?
|
Answer: (c).head-6-1-2-3-4-5-0-tail
|
97. | What is the functionality of the following piece of code?
|
Answer: (b).Return the element at the tail of the list and remove it from the list
|
98. | Consider the following doubly linked list: head-1-2-3-4-5-tail What will be the list after performing the given sequence of operations?
|
Answer: (b).head-6-1-2-3-4-tail
|
99. | Consider the 2-level skip list. How to access 38?
![]() |
Answer: (a).travel 20-30-35-38
|
100. | Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked list |
Answer: (b).I and III
|