Navigate

Question Detail

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.

Similar Questions :

1. The complexity of merge sort algorithm is

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

Answer: Option D

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

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

Answer: Option A

3. Which sorting method is slowest

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

Answer: Option D

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

  • One
  • Two
  • Three
  • Four

Answer: Option B

5. Which statement we should ignore in structure programming

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

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1