Assignment #3 - Priority Queues and Adaptable Priority Queue

This assignment is not easy. It requires you understand the related data structures, the algorithms, and it requires stong OO design. You should read through the assignment to get a basic idea of the requirements and then start working through the assignment in the recommended order.

Objectives:

The Assignment:

Getting Started:

  1. Download and import the following zip file: Assignment3.zip. For Eclipse:
    1. Open Eclipse
    2. Choose "File → Import"
    3. Select the "General" category
    4. Pick "Existing Projects into Workspace"
    5. Click on "Next"
    6. Select the button for "Select Archive File" and browse to/select the zip file.
    7. Click on "Finish"
    8. A new project has been added to the workspace: PriorityQueues, which provides TestingPQ.java, a sample (but incomplete) test platform, and three classes for potential Priority Queue implementations, OrderedPQ.java, UnorderedPQ.java, and Heap.java, also DefaultComparator.java. The net.datastructures package contains all of the interfaces needed for this assignment (including Entry, PriorityQueue ). There is also another package, sorting, which has code for Assignment 4. It can be ignored for this assignment.
  2. Copy the List implementation and any additional required files you used for Assignment 1 into your cs2321 directory for the project and use it to build all three Priority Queues.

Submission:

Grading Criteria: