Links to this web page
1 Important new information
2 The course
3 Times and places
4 Seminar talk reservations
5 Project reservations
One topic covers more than one lecture. Changes are possible.
Topic 1 Topic 2 Topic 3 Topic 7 Topic 4 Topic 8 Topic 5
Closely related elsewhere
This course in TUT Course Catalogue
Software studies at TUT
Supplementary material
Find an error in this program!
Preprint scientific paper behind Topic 4
Original scientific paper behind Topic 5
This web page contains practical information about the course and links to more information. The page is likely to change or be extended frequently during the course.
[ To Course contents and requirements ] [ To General Instructions for the Project ]
Bonuses and the status of the project
FS = first submission date MM-DD
MR = most recent submission date MM-DD
FB = feedback date MM-DD
| talks | activ | early | speed | doc | note | FS | MR | FB | mark | |
|---|---|---|---|---|---|---|---|---|---|---|
| AG | ½ | ½ | ||||||||
| AH | ½ | ½ | ||||||||
| AK | 1 | 1 | ||||||||
| AS | 0 | ½ | ||||||||
| CK | 0 | 0 | ½ | 0 | ½ | 12-11 | 12-19 | 12-28 | 2 | |
| CP | 0 | 0 | A. | 12-12 | 12-19 | |||||
| EK | 0 | ½ | ||||||||
| JoL | 1 | 1 | ||||||||
| JuJ | ½ | ½ | ||||||||
| JuL | 1½ | ½ | ½ | ½ | 1 | 12-09 | 12-21 | 12-28 | 5 | |
| JP | 0 | 0 | 1 | 1 | 0 | 12-11 | 12-19 | 12-21 | 3 | |
| MJ | 1 | 1 | 1 | 1 | 1 | 12-11 | 12-28 | 5 | ||
| OM | ½ | 1 | ||||||||
| TF | 1 | 1 | 1 | 1 | 0 | 12-12 | 12-21 | 5 | ||
| TJ | 0 | 1 | 0 | 2 | 1 | A. | 12-10 | 12-27 | 12-29 | 5 |
| TS | 1 | 1 | 0 | 1 | 1 | A. | 11-30 | 5 | ||
| VA | -½ | 0 | ||||||||
| VG | 0 | 0 | 1 | 1 | 0 | 12-12 | 12-28 | 3 |
Notes:
A. CP, TJ, and TS continue from the previous year.
In this course, theory learnt in earlier courses is put into practice, to learn to write efficient reliable programs for challenging tasks. Emphasis is on the use of good data structures and algorithms. The course consists of four components: lectures, seminars, a programming project, and its document.
The teacher of the course is Antti Valmari.
The lectures and seminars will be every Monday, Tuesday, and Wednesday at 10:15–12:00 in TC 128. The course starts on 2011-08-29. There will be no lectures and seminars on 2011-10-17, 18, 19 (examination week) and 2011-12-06 (public holiday). During the first weeks all the times are used for lectures. When the students are ready to give seminars, the times are flexibly used for lectures and seminars.
Deadline for submitting the program and its document is Sunday 2011-12-11. In practice, it suffices that they are submitted before the teacher comes to work next morning. Extension is negotiable.
This place contains information on who, when and on what topic will give seminar talks.
If you gave one or both talks last year, you need not give it this year. However, “fast solution submission“ bonus is then not given.
Past talks:
2011-09-28 AK ½ Triangle Partition
2011-09-28 OM ACM 2011 J (pyramids)
2011-10-04 MJ ½ Source code similarity comparison
2011-10-04 JoL ½ Binary decision diagrams
2011-10-10 VA 2010 ACM ICPC Problem J: Sharing Chocolate
2011-10-10 TF ½ 1996 ACM Problem B: Calling Circles
2011-10-11 AS Shannon switching game
2011-10-11 JP ACM-ICPC 2008: Anti Brute Force Lock
2011-10-24 JuL ½ Constraint satisfaction problem
2011-10-25 CK Identically Colored Panels Connection
2011-10-25 EK DFA minimization: old classic papers
2011-10-26 AH DFA minimization: new papers
2011-10-26 VG ACM (2003 World Final Problem A): Build Bridges
2011-10-31 AG 2-CNF
2011-11-02 JuJ ½ ACM 2011 Machine Works
2011-11-09 JoL ½ Graph isomorphism
2011-11-14 JuL ½½ Sudoku
2011-11-15 TF ½ Graph isomorphism
2011-11-16 MJ ½ NFA determinization
2011-11-21 AG ½ Sudoku
2011-11-22 AK ½ Japanese puzzle (nonogram)
2011-11-23 OM ½ Japanese puzzle (nonogram)
2011-11-23 EK NFA determinization
2011-11-28 VG NFA determinization
2011-11-28 CP Very efficient intersection of rectangles
2011-11-29 CK Sudoku
2011-11-30 JuJ Japanese puzzle (nonogram)
2011-11-30 AS Graph isomorphism
2011-12-05 AH ½ Very efficient intersection of rectangles
2011-12-05 JP Very efficient intersection of rectangles
2011-12-07 VA - NFA determinization
| Symbols after initials mean points: | |
| ! | = semi-active participation, half point |
|---|---|
| !! | = active participation, one point |
| ½ | = seminar was good, half point (same person may have two) |
| * | = point for some special reason |
More than one, but no more than four, students may have the same project topic. Here is a list of project topics with initials of those who have that as the topic: