Navigate

Question Detail

The complexity of Binary search algorithm is

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

Answer: Option B

Similar Questions :

1. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

2. Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

3. Which is ALGOL based simulation language

  • FORTRAN
  • SIMSCRIPT
  • GASP IV
  • none of above

Answer: Option B

4. The complexity of merge sort algorithm is

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

Answer: Option D

5. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1