DSA (QUIZ 5) Priority Queue and Sorting Algorithms Quiz

Which data structure is commonly used to implement priority queues?

• Stack

• Queue

• Heap

• Linked List

In a max-heap, the highest priority element is stored at which position?

• Leaf node

• Root node

• Leftmost node

• Rightmost node

What is the time complexity of inserting an element into a binary heap?

• O(1)

• O(log n)

• O(n)

• O(n log n)

What is the primary difference between a min-heap and a max-heap?

• Structure of the tree

• Order of elements

• Height of the tree

• Type of elements stored

Which of the following is NOT a valid application of a priority queue?

• Dijkstra's algorithm

• Huffman coding

• Undo operation in text editors

• CPU scheduling

What is the time complexity of the heapify operation in a binary heap?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which of the following sorting algorithms is closely related to the concept of heaps?

• Quick Sort

• Merge Sort

• Heap Sort

• Bubble Sort

In a priority queue implemented with a min-heap, which element is dequeued first?

• The largest element

• The smallest element

• A random element

• The middle element

Which of the following is true for a binary heap?

• It is always a complete binary tree

• It is always a full binary tree

• It is always a perfect binary tree

• It is always a balanced binary tree

Which data structure allows insertion and deletion at both ends but not in the middle?

• Stack

• Queue

• Deque

• Priority Queue