T-106.290 Ohjelmoinnin laboratoriotyöt

Topics, spring 2004

Below the alternative topics you may suggest during enrollment. Each group writes the report on exactly one topic, but at most five groups can choose the same topic. Topics are handed out in the order their requests arrive in the course enrollments. The number of credits given for a topic does not depend on the size of the group.

Many of the topics have been specified relatively loosely. If there is need to specify it more closely, unless otherwise stated, you should agree on the more exact specification in the first meeting with your group's teaching assistant.

1. Array search algorithms, 2 cr
2. Search trees, 3 or 4 ov
3. String search algorithms, 3 or 4 cr
4. Sorting, 3 cr
5. Regular expressions, 2 or 3 cr
6. RDBMS, 3 or 4 cr
7. Programming languages for numerical analysis, 4 cr
8. Programming languages for integer/string processing, 5 ov
9. Own topic, 2-5 cr

Own topics are welcome. Good areas for experimental algorithms might be, for example, cryptography, computer graphics, computational geometry, numerical analysis, search algorithms for NP-complete problems, etc.

You can suggest a topic also about technology evaluations, such as evaluating RDBMS's, programming languages, or programming methodology for a given task. Note that the topic should in any case require a sufficiently large and difficult programming effort, and the analysis of measurements needs to be sufficiently challenging.

If you have a suggestion for your own topic, ask the lecturer about it and to get information for further steps.