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 languages is often translated to the pseudo code

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC

Answer: Option A

2. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

Answer: Option A

3. A linear list from which elements can be added or removed from either end is called

  • stack
  • queue
  • deque
  • tree

Answer: Option C

4. Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

5. 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.

Read more from - Data Structure Questions Answers - Chapter 1