Submission

Please zip your entire directory and submit it via moodle by Monday 4/30 at 11:59pm.

Goals

In this assignment, you will create an application that uses a previous data structure for storage. You have a choice of 4 different options (or you can pitch your own), of varying challenge. The instructions for the applications are intentionally high level, as part of the assignment is to move from a high-level description to a structure for your code (i.e., skeleton files) to a working implementation.

Your can choose one of the following options, the difficulty of each is indicated by the number in brackets, with [3] being the most challenging:

• To do list (priority queue) [1], or
• Slide show (priority queue) [2], or
• Inverted index (hash table) [2], or
• Mini LinkedIn (graph) [3], or
• pitch your own application that uses a heap/priority queue, hash table or graph to me before the end of April 23!