This is an introductory course on theoretical computer science. Subjects covered are: basic automata theory, basics of formal languages and of the theory of computability, the theoretical limits of computers.
Day | Time | Location | |
Tue | 12-13 | Y228 | |
13-14 | Y228 | ||
Wed | 12-13 | Y228 | |
13-14 | Y228 | ||
14-15 | Y427B | ||
15-16 | Y427B | English | |
Thu | 16-17 | U358 | |
17-18 | U358 | ||
Fri | 8-9 | T2 | |
9-10 | T2 | ||
12-13 | Y405 | ||
13-14 | Y405 | ||
14-15 | Y427A | ||
15-16 | Y427A |
This year we experiment by awarding points from tutorial exercises. Tutorials have two kinds of exercises:
There are a total of 33 normal exercises on the course (3 each week). The examination points are awarded using the following table:
Exercise points | Bonus exam points |
5 | 1 |
10 | 2 |
15 | 3 |
20 | 4 |
25 | 5 |
30 | 6 |
However, it is not possible to change the grade from 0 to 1 with bonus points, so you have to get enough normal exam points to pass the course.
Tutorial exercises(The papers are also available from a rack outside room TB336):
Tutorial results.