Linked list are not suitable data structure of which one of the following problems ?

A. Binary search

B. Insertion sort

C. Radix sort

D. Polynomial manipulation

Related Questions

  1. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  2. The memory address of fifth element of an array can be calculated by the formula
  3. The complexity of Bubble sort algorithm is
  4. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  5. Merge sort uses ?
  6. Which data structure allows deleting data elements from and inserting at rear?
  7. The Average case occur in linear search algorithm
  8. When new data are to be inserted into a data structure, but there is no available space; this situation…
  9. Which of the following is not the required condition for binary search algorithm?
  10. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  11. Which one of the following permutations can be obtained the output using stack assuming that the input…
  12. Which of the following data structures are indexed structures?
  13. The elements of an array are stored successively in memory cells because
  14. Which of the following data structure is non linear type?
  15. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  16. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  17. Which of the following is not the part of ADT description?
  18. The term push and pop is related to the
  19. In linear search algorithm the Worst case occurs when
  20. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  21. If the values of a variable in one module is indirectly changed by another module, this situation is…
  22. Which of the following data structure is linear type?
  23. Which data structure is used in breadth first search of a graph to hold nodes?
  24. The complexity of Binary search algorithm is
  25. The number of possible ordered trees with three nodes A,B,C is?
  26. Which of the following statement is true ?
  27. A variable P is called pointer if
  28. Stack is also called as
  29. Finding the location of the element with a given value is:
  30. For an algorithm the complexity of the average case is

Please do not use chat terms. Example: avoid using "grt" instead of "great".