| Course book |
Norman L. Biggs, Discrete Mathematics (second edition), Oxford University Press, 2002.
| Contents |
The course treats computer related mathematical structures of algebraic, combinatorial and arithmetical character, which among others have applications to coding theory and cryptography.
The following is meant to be covered:
| Schedule |
Courses are tuesday 13-15 in EL42, wednesday 10-12 in ES51, thursday 15-17 in ES52 and friday 13-15 in EL42, with start week 36, tuesday 5 september. Wednesday and friday efternoon are exercise sessions, where homework can be done, while the remaining sessions are lectures.
| Examination |
At the end of the course there will be a written exam. NO material (including calculators) is allowed during the exam.
An important part of the course are the exercises. Homework (see below) is not compulsory, but can contibute 50% of the grade.
| Old exams |
Here is the exam from March 2003 with solutions. And here is the make up exam with solutions. And here the exam from October 2003 with solutions.
| Homework |
During the course there will be five opportunities to hand in homework.
Solutions are to be handed in individually, but you may (and should) discuss the problems with your fellow students. List in your solution your collaborators. Homework exercises can be solved during the exercise sessions, or in your own time. They should be handed in at the start of the lecture the next tuesday.
Exercises and homework will apppear here.
| Extra material |
Something on cryptography (in Swedish)
| Links |