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

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