PRIORITY QUEUE

Specialty Definition: PRIORITY QUEUE

Domain	Definition
Computing	Priority queue A data structure with three operations: insert a new item, return the highest priority item, and remove the highest priority item. The obvious way to represent priority queues is by maintaining a sorted list but this can make the insert operation very slow. Greater efficiency can be achieved by using heaps. (1996-03-12). Source: The Free On-line Dictionary of Computing.
Math	An abstract data type to efficiently support finding the item with the highest priority across a series of operations. The basic operations are: insert, find-minimum (or maximum), and delete-minimum (or maximum). Some implementations also efficiently support join two priority queues (meld), delete an arbitrary item, and increase the priority of a item (decrease-key). (references)
Source: compiled by the editor from various references; see credits.

Top

Specialty Definition: Priority queue

(From Wikipedia, the free Encyclopedia)

A priority queue is an abstract data type supporting the following two operations:

add an element to the queue with an associated priority
remove the element from the queue that has the highest priority, and return it

The simplest way to implement a priority queue is with an array of records containing elements and priorities, along with a count that tells how many elements of the array are used; adding an element involves incrementing that count and writing the new element and priority into the previously unused slot; removing the element requires searching through the array for the element with the highest priority, copying the last element into its slot, and decrementing that count.

This makes removing an element O(n) in the number of elements in the queue, which is somewhat inefficient if the queue gets large; a heap is a more efficient way to implement a priority queue for a large number of elements.

See also: scheduling

External links

http://www.leekillough.com/heaps/

Source: adapted by the editor from Wikipedia, the free encyclopedia under a copyleft GNU Free Documentation License (GFDL) from the article "Priority queue."

Top

Crosswords: PRIORITY QUEUE

Specialty definitions using "PRIORITY QUEUE": best-first search, binomial heap ♦ calendar queue ♦ Dijkstra's algorithm, double-ended priority queue ♦ hash heap ♦ monotone priority queue ♦ unsolvable problem. (references)

Top

Frequency of Internet Keywords: PRIORITY QUEUE

The following statistics estimate the number of searches per day across the major English-language search engines as identified by various trade publications. Hyperlinks lead to commercial use of the expression at Amazon.com.

Expression	Frequency per Day
priority queue	9
Source: compiled by the editor from various references; see credits.

Top

Anagrams: PRIORITY QUEUE

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "e-e-i-i-o-p-q-r-r-t-u-u-y"
	-5 letters: portiere, priority, requiter.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.

Top