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. ++i is equivalent to

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

Answer: Option B

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. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

4. The complexity of Bubble sort algorithm is

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

Answer: Option C

5. The memory address of the first element of an array is called

  • floor address
  • first address
  • foundation address
  • base address

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1