Home

Which of the following case does not exist in complexity theory

A. Best case

B. Null case

C. Worst case

D. Average case

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

You can do it
  1. Which of the following is non-liner data structure?
  2. The complexity of Bubble sort algorithm is
  3. The memory address of fifth element of an array can be calculated by the formula
  4. Which data structure is used in breadth first search of a graph to hold nodes?
  5. Which of the following algorithm design technique is used in the quick sort algorithm?
  6. Which of the following is not the part of ADT description?
  7. _____ is not the component of data structure.
  8. Which one of the following permutations can be obtained the output using stack assuming that the input…
  9. Which of the following data structure is linear data structure?
  10. Which of the following data structure is non linear type?
  11. The complexity of merge sort algorithm is
  12. The Average case occur in linear search algorithm
  13. Which of the following data structure store the homogeneous data elements?
  14. Which of the following name does not relate to stacks?
  15. Herder node is used as sentinel in ____
  16. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  17. Binary search algorithm can not be applied to
  18. Each array declaration need not give, implicitly or explicitly, the information about
  19. Which data structure allows deleting data elements from and inserting at rear?
  20. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…
  21. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  22. Identify the data structure which allows deletions at both ends of the list but insertion at only one…
  23. Two dimensional arrays are also called
  24. The complexity of linear search algorithm is
  25. ……………. Is a pile in which items are added at one end and removed from…
  26. The elements of an array are stored successively in memory cells because
  27. Which if the following is/are the levels of implementation of data structure
  28. The number of possible ordered trees with three nodes A,B,C is?
  29. Which of the following is not a limitation of binary search algorithm?
  30. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…