Escolar Documentos
Profissional Documentos
Cultura Documentos
Implementing min-heaps
Preamble
The results of this assignment, A6, are used in A7, which is an implementation of Dijkstras algorithm to find a
shortest path in a graph what googlemaps uses to find the best route from one place to another. In turn, A7 is used
in the final neat assignment A8. Final project A8 deals with delivery of packages by trucks, each truck being a different thread of execution. It brings together lots of things you are learning this course, and it requires some design
by you.
But first you need to learn about heaps, and the best way to do that is to program a heap. The version in A6 involves
implementing a heap with the added functionality of being able to change a priority. A6 requires meticulous attention to detail. But so that it doesnt take too long, we give you a complete JUnit testing program for it.
Keep track of how much time you spent on A6; we will ask for it upon submission.
Read this whole document before beginning to code.
The due date is Sunday, 12 April, But we suggest getting it done well before that date. The last month can be stressful. You will need MinHeap in writing A7, which we will be handing our right after Spring Break.
Getting help
If you don't know where to start, if you don't understand testing, if you are lost, etc., please SEE SOMEONE IMMEDIATELY an instructor, a TA, a consultant. Do not wait. A little in-person help can do wonders. See the course
homepage for contact information.