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. The complexity of Bubble sort algorithm is

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

Answer: Option C

3. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

Answer: Option A

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

5. Which of the languages is often translated to the pseudo code

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1