download Mastguru Android App

Question Detail

What are the minimum number of queues needed to implement the priority queue?

  • One
  • Two
  • Three
  • Four
Similar Questions :

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

  • linear list
  • tree
  • stack
  • queue

2. The complexity of Bubble sort algorithm is

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

3. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

4. What are the minimum number of queues needed to implement the priority queue?

  • One
  • Two
  • Three
  • Four

5. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment