Assignment 6

For this assignment, you will describe and implement the fifth and final release of your term project. You will incorporate a greedy algorithm as specified below. Submit this completed Word document as before, observing the 4-page limit excluding code etc..

1 SUMMARY DESCRIPTIONUPDATED (OR REPEATED IF UNCHANGED)

One-paragraph overall description of your proposed term projecthalf-page (12-point Times New Roman) limit.

Your response should replace this.

2 I/O EXAMPLE FROM PROJECTED COMPLETED PROJECTUPDATED (OR REPEATED IF UNCHANGED)

Provide an example of projected concrete output for designated input as if the entire project were completed. You will not be held to fulfilling exactly thisit is just explanatory, to indicate where your project is going. We recognize that project direction and details will change as the term progress. This section refers to the project as a whole.

Your response should replace this.

3 REQUIREMENTS IMPLEMENTED IN THIS RELEASE

Supply the functional requirements statement that you accomplished for this assignment, together with input where applicable, and output. Please state requirement in declarative form, as illustrated in the examples, because here we want to know the functionality intended (what, not how). Keep in mind that greedy programming is required in the implementation. Note whether or not true optimization is required.

3.1 Your (very brief) requirement title replaces this

Your first requirement should replace this.

3.2 Your (very brief) requirement title replaces this

Your second requirement should replace this.

More requirements if applicable

4 ILLUSTRATIVE OUTPUT

Provide illustrative output from your actual application showing that the requirements in part 3 have been met.

Your response should replace this.

5 YOUR DIRECTORY

Show a screenshot of your directory, including methods.

Your response should replace this.

6 GREEDY DESIGN IMPLEMENTED

Your implementation should include greedy programming in a manner that is useful to your application. This should be as specific to your application as possible. Avoid being generic. Explain where and how you applied this. Explain why is this optimal or suboptimal as the case may be.

Your response should replace this.

6.1 Class model and Sequence Diagram

Provide the class model (even if there is only one class). It should be as simple as possible but not simpler . Identify where you included graph processing. To do this use tools (e.g., Visio), PowerPoint, or a combine models as in this example (which you are free to cut and paste from). Insert indications in red (as in this example) to show where greedy programming is implemented.

Your response should replace this.

6.2 Code showing greedy programming

Your graph processing code should clearly use the algorithm outline in the notes here. Show the relevant code (only) and explain why greedy programming is appropriate here. It should be clear where the code is located (class and method). This should be consistent with section 6.1.

Your response should replace this.

6.3 Time complexity (efficiency)

Explain the efficiency of the algorithm you implemented. How does this affect your application in a practical way? How might it if the input data count increases?

Your response should replace this.

7 YOUR CODE

Please provide your code in a mode that will make access straightforward for your facilitator. Please contact your facilitator in advance if you need to check on this.

Your response should replace this.