Home

Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

A. mn

B. max(m,n)

C. min(m,n)

D. m+n-1

Share this question with your friends

Correct Answer : D.


Download Objective type questions of Data Structure PDF

Get all objective type questions of Data Structure MCQ

Related Questions

  1. A variable P is called pointer if
  2. The complexity of Bubble sort algorithm is
  3. When new data are to be inserted into a data structure, but there is no available space; this situation…
  4. Which data structure allows deleting data elements from and inserting at rear?
  5. Binary search algorithm can not be applied to
  6. A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…
  7. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…
  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 not linear data structure?
  10. Which of the following data structure is linear type?
  11. The difference between linear array and a record is
  12. The complexity of merge sort algorithm is
  13. Which of the following statement is false?
  14. For an algorithm the complexity of the average case is
  15. Which of the following is not the required condition for binary search algorithm?
  16. To represent hierarchical relationship between elements, Which data structure is suitable?
  17. The number of possible ordered trees with three nodes A,B,C is?
  18. Which of the following statement is true ?
  19. If the values of a variable in one module is indirectly changed by another module, this situation is…
  20. Which of the following algorithm design technique is used in the quick sort algorithm?
  21. Herder node is used as sentinel in ____
  22. Two dimensional arrays are also called
  23. ……………. Is a pile in which items are added at one end and removed from…
  24. _______ level is where the model becomes compatible executable code
  25. The complexity of linear search algorithm is
  26. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
  27. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
  28. _____ is not the component of data structure.
  29. The Average case occur in linear search algorithm
  30. Which of the following data structure store the homogeneous data elements?

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

Submit
Load More..

Also checkout these categories

Urologic infections and inflammations MCQ Chemistry in Service of Man MCQ Automobile Engineering MCQ Rearrangement Set 1 MCQ Windows 2000 Server MCQ Multimedia and Graphics MCQ Thermodynamics MCQ Letter and Symbol Series MCQ Phylum - Protozoa MCQ Urothelial tumors of the upper & lower urinary tracts MCQ Clock MCQ Property of Material MCQ