Q. In Circular Linked List insertion of a node involves the modification of ____ links.

View solution

Q. The time required to search an element in a linked list of length n is

View solution

Q. The worst case time required to search a given element in a sorted linked list of length n is

View solution

Q. If a list contains no elements it is said to be

View solution

Q. In a linked list array, objects are referred to as

View solution

Q. Linked list uses

View solution

Q. Number of elements stored in any list is called its

View solution

Q. Standard approach for implementation of a list is/are of

View solution

Q. An ordered sequence of data items are known to be

View solution

Q. First link node of list is accessed from a pointer named

View solution

Q. A linked list is made up of a set of objects known as

View solution

Q. Definition of a list is to be

View solution

Q. Beginnning of any list is called its

View solution

Q. Key design decision embodied in this ADT is support for concept of a

View solution

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