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. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort

3. The complexity of linear search algorithm is

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

4. The complexity of Bubble sort algorithm is

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

5. Repeated execution of simple computation may cause compounding of

  • round off errors
  • syntax errors
  • run time errors
  • logic errors
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment