May 1, 2024
Updated May 9, 2025
17 minute read
A priority queue is a fundamental abstract data type in computer science, similar to a regular queue or stack, but with a crucial difference: each element has an associated "priority." Instead of processing elements in a first-in, first-out (FIFO) manner like a standard queue, or last-in, first-out (LIFO) like a stack, a priority queue ensures that elements with higher priority are processed before elements with lower priority. If multiple elements share the same priority, they are typically handled based on their order in the queue. This concept is incredibly powerful and finds applications in a vast array of computing tasks where managing order based on importance is critical.
3e08up|
Find a path to becoming a Priority Queues. Learn more at:
OpenCourser.com/topic/3e08up/priority
Reading list
We've selected nine books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
Priority Queues.
Is an Italian-language translation of Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It provides a comprehensive overview of algorithms, including chapters on priority queues and their applications.
Russian-language translation of Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It provides a comprehensive overview of algorithms, including chapters on priority queues and their applications.
Provides a comprehensive overview of algorithms, including chapters on priority queues and their applications. It is suitable for advanced undergraduate and graduate students, and it is written by leading experts in the field.
German-language translation of Algorithms by Robert Sedgewick and Kevin Wayne. It covers a wide range of algorithms, including priority queues, and it is suitable for undergraduate students with some programming experience.
Spanish-language translation of Algorithms by Robert Sedgewick and Kevin Wayne. It covers a wide range of algorithms, including priority queues, and it is suitable for undergraduate students with some programming experience.
Korean-language translation of Algorithms by Robert Sedgewick and Kevin Wayne. It covers a wide range of algorithms, including priority queues, and it is suitable for undergraduate students with some programming experience.
Japanese-language translation of Algorithms by Robert Sedgewick and Kevin Wayne. It covers a wide range of algorithms, including priority queues, and it is suitable for undergraduate students with some programming experience.
Covers data structures and algorithms in Java. It includes a chapter on priority queues, and it is suitable for undergraduate students with some programming experience.
French-language introduction to algorithms and data structures. It includes a chapter on priority queues, and it is suitable for undergraduate students with some programming experience.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/3e08up/priority
Save
