Assignment 5: A To-Do List

Assigned: Friday, April 14, 2000
Due: Friday, April 21, 2000

Preliminaries

In this assignment, you will build a simple ``to-do list'' application using an array-based heap as the underlying data structure.

I strongly encourage you to work in a group. You may have no more than three members in your group, and no two members of your group may be on the same project team.

Helpful files:

• Prioritized.java
• PrioritizedTask.java

The Assignment

Build a simple to-do list application. The application should

• allow users to add new tasks with a particular priority
• determine their highest-priority task
• delete their highest-priority task

You must use an array-based heap for your implementation. You may limit the number of values in the to-do list to 100.

You must also do at least one of the following tasks (it's up to you which ones):

• allow the user to change the priority of the highest-priority task
• allow the user to view all tasks in order of priority
• provide a graphical user interface