Data Structure Questions Answers - Chapter 1

• 29. The complexity of merge sort algorithm is

  1. O(n)
  2. O(log n)
  3. O(n2)
  4. O(n log n)

  Answer And Explanation

  Answer: Option D

  Explanation:

  • View Answer
  • Comment on this question

• 30. What are the minimum number of queues needed to implement the priority queue?

  1. One
  2. Two
  3. Three
  4. Four

  Answer And Explanation

  Answer: Option B

  Explanation:

  One queue is used for the actual storing of data, and the other one is used for storing the priorities.

  • View Answer
  • Comment on this question