Navigate

Question Detail

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

  • One
  • Two
  • Three
  • Four

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. Which statement we should ignore in structure programming

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

Answer: Option B

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

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

Answer: Option D

4. A linear list from which elements can be added or removed from either end is called

  • stack
  • queue
  • deque
  • tree

Answer: Option C

5. The complexity of Binary search algorithm is

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

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1