Priority Queue Introduction and Concept in DSA C# - 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 serves elements in the order they arrive.

beginner

How does a Priority Queue differ from a regular Queue?

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

beginner

What are common operations of a Priority Queue?

Common operations include: Insert (add element with priority), Peek (look at highest priority element), and Remove (remove highest priority element).

intermediate

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

A heap (usually a binary heap) is often used because it allows quick access to the highest priority element and efficient insertion and removal.

beginner

Why is a Priority Queue useful in real life?

It helps manage tasks or items where some are more important than others, like scheduling jobs in a printer queue or managing emergency room patients by severity.

What determines the order of elements in a Priority Queue?

A The order elements were added

B The size of elements

C The priority of elements

D The alphabetical order of elements

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

Which operation would you use to see the highest priority element without removing it?

A Insert

B Peek

C Remove

D Sort

Peek lets you look at the highest priority element without removing it.

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

A Array

B Linked List

C Stack

D Heap

Heaps allow fast access to the highest priority element and efficient insertions/removals.

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

A The element added first

B Random choice

C The element with larger size

D The element with smaller size

Usually, if priorities are equal, the element added first is served first (stable priority queue).

Which of these is NOT a typical use case for a Priority Queue?

A Printing documents in arrival order

B Emergency room patient management

C Task scheduling

D Dijkstra's shortest path algorithm

Printing documents in arrival order is a normal queue use case, not a priority queue.

Explain what a Priority Queue is and how it works.

Think about how some tasks are more important and get done first.

Describe common operations of a Priority Queue and their purpose.

Consider how you add tasks, check the most important task, and remove it.

Practice

1. What is the main characteristic of a Priority Queue compared to a regular queue?

easy

A. Elements are dequeued in the exact order they were enqueued

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

C. It only stores elements of the same data type

D. It allows random access to elements by index

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 B

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 allows random access
• Assuming priority queue only stores one data type

2. Which of the following is the correct way to declare a priority queue of integers in C# using System.Collections.Generic.PriorityQueue?

easy

A. var pq = new PriorityQueue();

B. var pq = new PriorityQueue<int>();

C. PriorityQueue<int> pq = new PriorityQueue<>();

D. PriorityQueue pq = new PriorityQueue();

Solution

1. Step 1: Recall PriorityQueue syntax in C#

   The generic PriorityQueue requires two types: element type and priority type.

2. Step 2: Check each option

   var pq = new PriorityQueue(); correctly uses PriorityQueue<int, int>. Others have syntax errors or missing types.

3. Final Answer:

   var pq = new PriorityQueue(); -> Option A

4. Quick Check:

   PriorityQueue<TElement, TPriority> syntax [OK]

Hint: PriorityQueue needs element and priority types in angle brackets [OK]

Common Mistakes:

• Omitting priority type in generic declaration
• Using wrong constructor syntax
• Trying to declare without generic types

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

var pq = new PriorityQueue();
pq.Enqueue("apple", 3);
pq.Enqueue("banana", 1);
pq.Enqueue("cherry", 2);
while (pq.Count > 0) {
    Console.Write(pq.Dequeue() + " ");
}

medium

A. banana cherry apple

B. apple cherry banana

C. cherry banana apple

D. apple banana cherry

Solution

1. Step 1: Understand enqueue priorities

   Elements are enqueued with priorities: apple=3, banana=1, cherry=2.

2. Step 2: Dequeue order based on priority

   PriorityQueue dequeues elements with lowest priority first: banana(1), cherry(2), apple(3).

3. Final Answer:

   banana cherry apple -> Option A

4. Quick Check:

   Lowest priority dequeued first = banana cherry apple [OK]

Hint: PriorityQueue dequeues lowest priority first by default [OK]

Common Mistakes:

• Assuming highest priority dequeued first
• Mixing element order with priority order
• Ignoring priority values

4. Identify the error in the following C# code using PriorityQueue:

var pq = new PriorityQueue();
pq.Enqueue(10, 2);
pq.Enqueue(5);
pq.Enqueue(20, 1);

medium

A. Enqueue method does not exist

B. PriorityQueue cannot store integers

C. PriorityQueue requires three generic types

D. Missing priority argument in second Enqueue call

Solution

1. Step 1: Check Enqueue method parameters

   Enqueue requires two arguments: element and priority.

2. Step 2: Identify incorrect call

   The second Enqueue call pq.Enqueue(5); misses the priority argument.

3. Final Answer:

   Missing priority argument in second Enqueue call -> Option D

4. Quick Check:

   Enqueue needs element and priority [OK]

Hint: Enqueue always needs element and priority arguments [OK]

Common Mistakes:

• Forgetting priority argument in Enqueue
• Thinking PriorityQueue needs three types
• Assuming Enqueue accepts one argument

5. You want to process tasks with priorities where higher numbers mean higher priority. How can you use C#'s PriorityQueue to dequeue tasks in order from highest to lowest priority?

hard

A. Use PriorityQueue as is; it dequeues highest priority first

B. Sort the queue manually after enqueueing

C. Store priorities as negative values when enqueuing

D. Use a Stack instead of PriorityQueue

Solution

1. Step 1: Understand PriorityQueue default behavior

   C# PriorityQueue dequeues elements with lowest priority first by default.

2. Step 2: Adjust priorities to reverse order

   To get highest priority first, store priorities as negative values (e.g., -priority).

3. Final Answer:

   Store priorities as negative values when enqueuing -> Option C

4. Quick Check:

   Invert priorities to reverse dequeue order [OK]

Hint: Invert priorities (negative) to get highest priority first [OK]

Common Mistakes:

• Assuming PriorityQueue dequeues highest priority first by default
• Trying to sort queue manually
• Using Stack which doesn't handle priorities