Navigate

Question Detail

The complexity of merge sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option D

Similar Questions :

1. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

Answer: Option A

2. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

Answer: Option D

3. The complexity of merge sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option D

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

  • One
  • Two
  • Three
  • Four

Answer: Option B

Explanation:

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

5. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1