Q. In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is

View solution

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

View solution

Q. The time required to delete a node x from a doubly linked list having n nodes is

View solution

Q. A collection of data items of similar type arranged in a sequence is termed as?

View solution

Q. A linked list is a linear collection of homogeneous elements called______.

View solution

Q. Depending on what on what can a linked list be classified into various other types?

View solution

Q. In a singly-linked list (linear linked list), how many fields does each node consists of?

View solution

Q. The last node of the singly-linked list contains__________.

View solution

Q. A linked list contains a list pointer variable _____that stores the address of the first node of the list.

View solution

Q. To maintain a linked list in memory, how many parallel arrays of equal size are used?

View solution

Q. As memory is allocated dynamically to a linked list, a new node can be inserted anytime in the list. For this, the memory manager maintains a special linked list known as___________.

View solution

Q. While creating a linked list or inserting an element into a linked list, whenever a request for the new node arrives, the memory manager searches through the ------------for the block of desired size.

View solution

Q. What does creating a node mean?

View solution

Q. _________a list means accessing its elements one by one to process all or some of the elements.

View solution

Q. Searching a value (say, item) in a linked list means finding the position of the node, which stores ___________ as its value?

View solution

Q. A situation where the user tries to delete a node from an empty linked list is termed as___________.

View solution

Q. To delete a node from the end of a linked list, the list is traversed up to the last ______.

View solution

Q. Since a doubly-linked list allows traversing in both the forward and backward directions, it is also referred to as a___________.

View solution

Q. Direct or random access of elements is not possible in ...............

View solution

Q. To implement Sparse matrix dynamically, the following data structure is used

View solution