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

Q. Applications of Linked List are

View solution

Q. What are the time complexities of finding 8th element from beginning and 8th element from end in a singly linked list? Let n be the number of nodes in linked list, you may assume that n>8.

View solution

Q. Overflow condition in linked list may occur when attempting to .............

View solution

Q. Linked lists are not suitable data structures for which one of the following problems?

View solution

Q. Generally collection of Nodes is called as __________.

View solution

Q. A linear collection of data element given by mean of pointer is called ______________.

View solution

Q. Which of the following is not a type of Linked List ?

View solution

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

View solution

Q. Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.

View solution

Q. Consider the Singly linked list having n elements. What will be the time taken to add an node at the end of linked list if Pointer is initially pointing to first node of the list.

View solution