Monterey, CA; Naval Postgraduate School
Comparison and analysis of some algorithms for implementing priority queues
Abstract
dc:description.abstractA priority queue is a data structure for maintaining a collection of items, each having an associated key, such that the item with the largest key is easily accessible. Priority queues are implemented by using heap, k-ary tree, single linked-list, leftist tree, linked tree, AVL-tree, 2-3 tree, and fixed priority property. Required storage for each method was obtained and the worst case time analysis was done in terms of the number of key comparison and key exchanges during the insertion and deletion process. Finally, each of these methods were run on PIP-11 UNIX TIME SEARING SYSTEM at NPS using different random number generators to get the average CPU times for insertion and deletion process.
Degree
thesis:*- Name thesis:degree_name
- M.S. in Computer Science
- Level thesis:degree_level
- Masters
- Discipline thesis:degree_discipline
- Computer Science
- Department dc:contributor.department
- Computer Science
- Grantor dc:publisher
- Monterey, CA; Naval Postgraduate School
- Year dc:date.issued
- 1980
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Goksel, Alinur
- Advisor dc:contributor.advisor
-
- Smith, Douglas R.
- Committee member dc:contributor.committeemember
-
- Cox, L.A., Jr.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright is reserved by the copyright owner.
- Approved for public release; distribution is unlimited.
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- https://hdl.handle.net/10945/17544