Project

Implementing Priority Queues Lab

Overview of project

• Author: Cristian Joita
• Indices on this project:
  • Example Of-Data Structures
  • Design Issue-Performance and Internal Representation
  • Example Of-Polymorphic Class Demos
  • Example Of-Smalltalk Blocks
  • Example Of-Classes as Objects
• Complexity of this project: High
• What you will have when you're done:
  • An implementation of a priority queue with an unsorted linked list
  • Familiarity with Collection operations
  • A better understanding of how data structures affect performance, and how timing the performance of specific tasks can help you decide on the best data structure for that particular task
  • An understanding of the Smalltalk block construct
  • A set of timing results for running a demo on each implementation
• Strategy for this problem: Implement a Priority Queue with an unsorted linked list. Compare the performance of this implementation with that of two given ones.

Steps in this project

• Implement a priority queue class and compare its performance to two given queues.
• Test out the provided PriorityQueueSC and PriorityQueueOC.
• Time the different forms of PriorityQueue
• Build your own PriorityQueues
• Time your own PriorityQueue
• What to turn in

Representations of this project

Concepts used in this project

Generics appearing in this project

• Tips on using Collections for managing data structures.