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

Q. Pointer is pointing to the first element of the Node then time require to Insert Element to second position is __________.

View solution

Q. Consider a linked list of n elements. What is the time taken to insert an element after element pointed by same pointer ?

View solution

Q. The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used ?

View solution

Q. Time require to find any element of the linked list is _______.

View solution

Q. struct node *current = start->next
what "current" will contain if it is variable of type struct node ?

View solution

Q. If start is pointing to first node of the linked list then consider the following statement -

start = start->next;
current = start->next;

what will be the value of address field of current ?

View solution

Q. In Linked list implementation, a node carries information regarding _______.

View solution

Q. A linked list in which the last node of Linked list points to the first is called a _________.

View solution