Homework 11

Comments

• Most problems are found in one of the following:
  1. ADM: The Algorithm Design Manual
  2. IDMA: An Introduction to Discrete Mathematics and Algorithms
• For full credit, provide context for each problem, show all calculations, and justify all answers by providing enough comments to explain your reasoning.
• You will lose a significant amount of credit if you do not provide context, calculations, and justifications for a problem.
• Numbers and/or algebra by themselves are not enough. A correct answer with no justification will be worth no more than half credit, and sometimes much less than that.
• Precision is very important. You cannot skip steps, make guesses, or use flawed logic. Any of these things can lead to incorrect answers.
• Homework assignments must be very neatly written or typeset (e.g. using Word or OpenOffice).
• NEW! If you want to learn LaTeX, see the LaTeX section of Writing Notes for a sample LaTeX document. The machines in the lab have TexWorks installed. You may have to ask around to figure out how to compile a file the first time.
• You must indicate any assistance/collaboration you had on an assignment as specified on the Policies page.
• NEW! If a problem asks for an algorithm, you should give the most efficient algorithm you can find to ensure full credit. You should also specify the complexity of the algorithm with justification, whether or not the problem asks for it.

Details

The following problems are from pages 227 of ADM

Problem	Notes
6-14	See the new Algorithm Rubric
6-17	See the new Proof Rubric
Algoraph Problem	See Below

Use the Algoraph plugin to implement one of the following:

1. Prim's Algorithm. Use MinimumSpanningTreeInstance. To output the result, create a MultiEdgeChosenEvent using the constructor that takes an EdgeChooseInstance (MinimumSpanningTreeInstance is a subclass of this) and an ArrayList of edges. Pass in puzzle and your ArrayList of tree edges. Return encodeEvent.
2. Kruskal's Algorithm. See the previous option for more details.
3. Dijkstra's Algorithm. Use SSShortestPath. Otherwise, follow the same details from Prim's Algorithm above.
4. Floyd's Algorithm. Use WeightedInstance. Output the matrix. I may give further details.