Priority Queue Introduction and Concept in DSA Python - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Priority Queue?

A Priority Queue is a special type of queue where each element has a priority. Elements with higher priority are served before elements with lower priority, unlike a normal queue which follows first-in-first-out order.

beginner

How does a Priority Queue differ from a regular Queue?

In a regular queue, elements are processed in the order they arrive (FIFO). In a Priority Queue, elements are processed based on their priority, not just arrival order.

beginner

What are common operations of a Priority Queue?

Common operations include:
1. Insert (add an element with priority)
2. Extract (remove the element with highest priority)
3. Peek (view the element with highest priority without removing it)

intermediate

Which data structure is often used to implement a Priority Queue efficiently?

A Priority Queue is often implemented using a Heap (usually a binary heap) because it allows fast insertion and extraction of the highest priority element.

beginner

Give a real-life example of a Priority Queue.

An example is an emergency room in a hospital where patients with more serious conditions are treated before others, regardless of arrival time.

What determines the order of elements in a Priority Queue?

A The size of elements

B The order elements were added

C The alphabetical order of elements

D The priority of elements

Priority Queues serve elements based on their priority, not the order they were added.

Which operation removes the element with the highest priority from a Priority Queue?

A Peek

B Insert

C Extract

D Sort

Extract removes and returns the element with the highest priority.

What data structure is commonly used to implement a Priority Queue efficiently?

A Heap

B Linked List

C Array

D Stack

Heaps allow fast insertion and removal of the highest priority element.

In a Priority Queue, if two elements have the same priority, which one is served first?

A Depends on implementation

B The one added first

C Randomly chosen

D The one added last

Handling of elements with equal priority depends on the specific Priority Queue implementation.

Which of these is NOT a typical operation of a Priority Queue?

A Extract

B Reverse

C Peek

D Insert

Reversing is not a standard Priority Queue operation.

Explain what a Priority Queue is and how it works compared to a normal queue.

Think about how emergencies are handled differently than normal lines.

Describe the main operations of a Priority Queue and why a heap is a good choice for its implementation.

Consider how to quickly find and remove the highest priority element.

Practice

1. What is the main feature of a priority queue compared to a regular queue?

easy

A. It does not allow insertion after creation

B. Elements are always dequeued in the order they were inserted

C. It only stores elements of the same value

D. Elements are dequeued based on their priority, not just order of insertion

Solution

1. Step 1: Understand queue behavior

   A regular queue removes elements in the order they were added (FIFO).

2. Step 2: Understand priority queue behavior

   A priority queue removes elements based on priority, not just order.

3. Final Answer:

   Elements are dequeued based on their priority, not just order of insertion -> Option D

4. Quick Check:

   Priority queue = priority-based removal [OK]

Hint: Priority queue removes highest priority first, not oldest [OK]

Common Mistakes:

• Confusing priority queue with FIFO queue
• Thinking priority queue only stores equal values
• Assuming no insertion allowed after creation

2. Which of the following is the correct way to import and create a min-priority queue using Python's heapq module?

easy

A. from queue import PriorityQueue; pq = PriorityQueue()

B. import heapq; pq = []

C. import heapq; pq = heapq.PriorityQueue()

D. import queue; pq = queue.heapq()

Solution

1. Step 1: Identify correct module for heapq min-priority queue

   Python's heapq module implements min-heap using lists.

2. Step 2: Check import and creation syntax

   import heapq; pq = [] correctly imports heapq and creates an empty list to use as heap.

3. Final Answer:

   import heapq; pq = [] -> Option B

4. Quick Check:

   heapq module with empty list = correct [OK]

Hint: heapq uses empty list [] for min-heap [OK]

Common Mistakes:

• Confusing heapq (functions) with PriorityQueue class
• Trying to call heapq.PriorityQueue() which doesn't exist
• Wrong import statements

3. What will be the output of the following code?

import heapq
pq = []
heapq.heappush(pq, 20)
heapq.heappush(pq, 5)
heapq.heappush(pq, 15)
print(heapq.heappop(pq))

medium

A. 5

B. 20

C. 15

D. Error

Solution

1. Step 1: Understand heapq behavior

   heapq creates a min-heap, so smallest element is popped first.

2. Step 2: Trace the pushes and pop

   Elements pushed: 20, 5, 15. The smallest is 5, so heappop returns 5.

3. Final Answer:

   5 -> Option A

4. Quick Check:

   Min-heap pop = smallest element = 5 [OK]

Hint: heapq pops smallest element first [OK]

Common Mistakes:

• Thinking heapq pops largest element
• Confusing push order with pop order
• Expecting error due to empty heap

4. Identify the error in the following code that tries to implement a max-priority queue using heapq:

import heapq
pq = []
heapq.heappush(pq, 10)
heapq.heappush(pq, 30)
heapq.heappush(pq, 20)
max_val = heapq.heappop(pq)
print(max_val)

medium

A. pq should be a list of tuples, not integers

B. heapq does not support push operation

C. heapq.heappop returns the smallest element, not the largest

D. Missing call to heapq.heapify before pushing

Solution

1. Step 1: Understand heapq default behavior

   heapq implements a min-heap, so heappop returns smallest element.

2. Step 2: Check code for max-priority queue logic

   The code pushes values directly and pops, expecting max but gets min.

3. Final Answer:

   heapq.heappop returns the smallest element, not the largest -> Option C

4. Quick Check:

   heapq pop = smallest, not max [OK]

Hint: heapq pops smallest; invert values for max-heap [OK]

Common Mistakes:

• Expecting heappop to return max without inversion
• Not using negative values to simulate max-heap
• Assuming heapq needs heapify before every push

5. You want to implement a max-priority queue using Python's heapq module. Which approach correctly achieves this?

hard

A. Push negative values and pop normally, then negate again

B. Use heapq as is, it supports max-heap by default

C. Sort the list after every push to get max element

D. Use a separate max() function after popping from heapq

Solution

1. Step 1: Understand heapq default behavior

   heapq is a min-heap, so it pops smallest element by default.

2. Step 2: Implement max-heap using negation

   By pushing negative values, the smallest negative corresponds to largest original value. Pop and negate again to get max.

3. Final Answer:

   Push negative values and pop normally, then negate again -> Option A

4. Quick Check:

   Negate values to simulate max-heap with heapq [OK]

Hint: Invert values (negate) to use min-heap as max-heap [OK]

Common Mistakes:

• Assuming heapq supports max-heap natively
• Sorting list after every push is inefficient
• Using max() after pop breaks priority queue logic