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

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

2. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

3. Which is having highest precedence in C

  • relational operators
  • equality operator
  • logical operator
  • arithmetic operator

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

  • linear list
  • tree
  • stack
  • queue

5. The complexity of linear search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment