Navigate

Question Detail

The complexity of linear search algorithm is

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

Answer: Option A

Similar Questions :

1. Which is ALGOL based simulation language

  • FORTRAN
  • SIMSCRIPT
  • GASP IV
  • none of above

Answer: Option B

2. minimum number of stacks of size n required to implement a queue of size n

  • One
  • Two
  • Three
  • Four

Answer: Option B

3. Which statement we should ignore in structure programming

  • WHILE-DO
  • GO-TO
  • IT-ELSE
  • SWITCH

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. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1