Q. A pointer that is used to keep last link of list is called

View solution

Q. End of any list is called its

View solution

Q. Important concept related to lists is of

View solution

Q. Which of the following is false about a doubly linked list?

View solution

Q. What is a memory efficient double linked list?

View solution

Q. How do you calculate the pointer difference in a memory efficient double linked list?

View solution

Q. What is the time complexity of inserting a node in a doubly linked list?

View solution

Q. Consider the 2-level skip list. How to access 38?

View solution

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

View solution

Q. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

View solution

Q. What would be the asymptotic time complexity to add an element in the linked list?

View solution

Q. What would be the asymptotic time complexity to find an element in the linked list?

View solution

Q. What would be the asymptotic time complexity to insert an element at the second position in the linked list?

View solution

Q. The concatenation of two list can performed in O(1) time. Which of the following variation of linked list can be used?

View solution

Q. Linked lists are not suitable to for the implementation of?

View solution

Q. Linked list is considered as an example of ___________ type of memory allocation.

View solution

Q. In Linked List implementation, a node carries information regarding

View solution

Q. Linked list data structure offers considerable saving in

View solution

Q. Which of the following is not a disadvantage to the usage of array?

View solution

Q. What is the time complexity of inserting at the end in dynamic arrays?

View solution