Programming Assignment: Topic and Approach - Prof. Martine C. Ceberio, Assignments of Data Structures and Algorithms

A programming assignment with a given topic and the approach to solve it. The assignment includes an introduction to the problem, the solving approach with pseudo-code, optional implementation details, theoretical performance analysis, testing strategy, experimental results, and a conclusion. Students are expected to explain why their approach solves the problem and analyze the results.

Typology: Assignments

Pre 2010

Uploaded on 08/19/2009

koofers-user-u2s
koofers-user-u2s 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Student Name 1
Student Name 2
Programming assignment #n
Topic of the assignment (e.g., Diagonal Sudoku)
1. Introduction.
Here goes the description of the problem you address: what is the problem given to
you? why is it a problem? what is the challenge?
Presentation of the following sections: e.g., “In Section 2, we will present the
problem in more details and introduce our solving approach. In Section 3, we will
give implementation details (optional section). We will analyze our algorithm in
Section 4, and present our testing strategy in Section 5. Experimental results
will be reported and analyzed in Section 6, before to conclude in Section 7.”
2. The problem and our solving approach.
Here goes the description of the way you plan to address this problem: basically
an informal description, along with your algorithm*.
* your algorithm should be presented in pseudo-code, not in actual code.
You have to explain (justify) why your approach actually solves the given problem.
3. Implementation details (optional)
In this section, you will present all significant details/choices of your
implementation.
This section should not contain your code: only relevant parts that support the
description of the specificities of your implementation.
4. Performance of our approach.
Here goes the theoretical study of your algorithm: if required in the assignment
(e.g., this is the case for the first assignment).
5. Our testing strategy.
In this part, you have to describe your testing strategy: which tests you plan to
run and why? what you expect out of your experiments? etc.
6. Experimental results.
Here you present/report your results. You have to decide which format you should
present your results in: table and/or diagram? other?
Please keep in mind that the setting of your results needs to make sense and be
easy to read and understand.
Don't forget that you also need to analyze your results: what do they mean? what
kind of outcome do you get from these results? In particular, does it support your
“on the paper” analysis of your program? does it show that your program works
well? if not, why? is it something that can be fixed? (you have to be honest, and
pf2

Partial preview of the text

Download Programming Assignment: Topic and Approach - Prof. Martine C. Ceberio and more Assignments Data Structures and Algorithms in PDF only on Docsity!

Student Name 1 Student Name 2 Programming assignment #n Topic of the assignment (e.g., Diagonal Sudoku)

1. Introduction. Here goes the description of the problem you address: what is the problem given to you? why is it a problem? what is the challenge? Presentation of the following sections: e.g., “In Section 2, we will present the problem in more details and introduce our solving approach. In Section 3, we will give implementation details (optional section). We will analyze our algorithm in Section 4, and present our testing strategy in Section 5. Experimental results will be reported and analyzed in Section 6, before to conclude in Section 7.” 2. The problem and our solving approach. Here goes the description of the way you plan to address this problem: basically an informal description, along with your algorithm*.

  • your algorithm should be presented in pseudo-code, not in actual code. You have to explain (justify) why your approach actually solves the given problem. 3. Implementation details (optional) In this section, you will present all significant details/choices of your implementation. This section should not contain your code: only relevant parts that support the description of the specificities of your implementation. 4. Performance of our approach. Here goes the theoretical study of your algorithm: if required in the assignment (e.g., this is the case for the first assignment). 5. Our testing strategy. In this part, you have to describe your testing strategy: which tests you plan to run and why? what you expect out of your experiments? etc. 6. Experimental results. Here you present/report your results. You have to decide which format you should present your results in: table and/or diagram? other? Please keep in mind that the setting of your results needs to make sense and be easy to read and understand. Don't forget that you also need to analyze your results: what do they mean? what kind of outcome do you get from these results? In particular, does it support your “on the paper” analysis of your program? does it show that your program works well? if not, why? is it something that can be fixed? (you have to be honest, and

we all know that there is no perfect program working all at once perfectly, so please acknowledge your errors and show that you can learn from them and plan a fixing strategy).

7. Conclusion. Here, you summarize what was the problem, what you have done, how it went, etc. What you've learnt overall.