adplus-dvertising
frame-decoration

Question

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

a.

Insertion sort

b.

Binary search

c.

Radix sort

d.

Polynomial manipulation

Answer: (b).Binary search

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

Q. Generally collection of Nodes is called as __________.

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

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

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

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

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.

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

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

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 ?

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

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

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 ?

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

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

Q. A doubly linked list performs traversal in _________.

Q. Linked list data structure usage offers considerable saving in

Q. Consider linked list is used to implement the Stack then which of the following node is considered as Top of the Stack ?

Q. The link field in the last node of the linked list contains _________.

Q. When new element is added in the middle of singly linked list then ________.

Q. Which of the following operation is performed more efficiently in doubly linked list ?