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. The complexity of linear search algorithm is

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

Answer: Option A

2. In C how many parameters can passed to a function

  • 2
  • 5
  • 10
  • as many as defined in function definition

Answer: Option D

3. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

4. Preorder is

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

Answer: Option A

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

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1