Home

The Average case occur in linear search algorithm

A. When Item is somewhere in the middle of the array

B. When Item is not in the array at all

C. When Item is the last element in the array

D. When Item is the last element in the array or is not there at all

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

You can do it
  1. The number of possible ordered trees with three nodes A,B,C is?
  2. A variable P is called pointer if
  3. Arrays are best data structures
  4. Which of the following is not the part of ADT description?
  5. Which of the following data structures are indexed structures?
  6. Which of the following data structure can't store the non-homogeneous data elements?
  7. The term push and pop is related to the
  8. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…
  9. Which data structure allows deleting data elements from and inserting at rear?
  10. Which data structure is used in breadth first search of a graph to hold nodes?
  11. Which of the following is two way list?
  12. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  13. The memory address of fifth element of an array can be calculated by the formula
  14. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
  15. The complexity of Bubble sort algorithm is
  16. If the values of a variable in one module is indirectly changed by another module, this situation is…
  17. Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
  18. _______ level is where the model becomes compatible executable code
  19. Finding the location of the element with a given value is:
  20. Linked list are not suitable data structure of which one of the following problems ?
  21. Which of the following algorithm design technique is used in the quick sort algorithm?
  22. The operation of processing each element in the list is known as
  23. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  24. Which of the following data structure is non linear type?
  25. Which of the following is non-liner data structure?
  26. When determining the efficiency of algorithm the time factor is measured by
  27. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  28. In linear search algorithm the Worst case occurs when
  29. Which of the following data structure is linear data structure?
  30. Two dimensional arrays are also called