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 memory address of the first element of an array is called

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

2. The complexity of linear search algorithm is

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

3. Sort which compares adjacent elements in a list and switches where necessary is

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

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

  • One
  • Two
  • Three
  • Four

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

  • stack
  • queue
  • deque
  • tree
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment