Back to homepage.

Discrete Mathematics and Logic --- Winter 2008

You can download some lecture notes covering most of the curriculum . For the logic part of the curriculum, you can download either of the texts

1. J. Gallier: Logic for Computer Science: Foundations of Automatic Theorem Proving, Wiley, 1986.
2. L. van den Dries: Logic notes. (dvi file)

Next meetings:

1. Thursday, 6 November 2008, 11:00, department of mathematics (we will meet at the entrance to the department). Study by yourselves the induction principles, we will be discussing them.
2. Thursday, 13 November 2008, 11:15, department of mathematics (we will meet at the entrance to the department). Study by yourselves the basics of counting modulo (divisibility, Euclid's Algorithm, congruence, inverse), we will be discussing them.
3. Thursday, 27 November 2008, 11:15, department of mathematics (we will meet at the entrance to the department). Study by yourselves the advanced topics of counting modulo (linear algebra, linear codes, Fermat's and Euler's Theorem, Chinese Remainder Theorem), we will be discussing them.
4. Thursday, 11 December 2008, 11:15, department of mathematics (we will meet at the entrance to the department). Study by yourselves the safety and correctness of RSA encyphering, we will be discussing the traffic of RSA. Linear algebra and linear codes will be discussed as well.
5. Thursday, 18 December 2008, 11:15, department of mathematics (we will meet at the entrance to the department). The session will be computational: we will run Euclid's algorithm, computes inverses, solve systems of linear equations, use Chinese Remainder Theorem, repeated squares and Euler's Theorem to compute large powers. Bring along your pocket calculators.
6. Thursday, 8 January 2009, 11:15, department of mathematics (we will meet at the entrance to the department). Basic algebraic structures on one binary operation will be discussed.
7. Thursday, 15 January 2009, 11:15, department of mathematics (we will meet at the entrance to the department). Basic algebraic structures on one binary operation will be discussed: groupoids, semigroups, monoids and groups.

Structure of the exam:

• Written test will consist of four problems, you will have 150 minutes. For every problem you get up to 20 points, making the total of 80 points. A sample of the written test .
• Oral exam: a theoretical question for up to 20 points. This part is not obligatory, it allows you to add points to those you had got for the written exam. Difficulty of the question depends on how many points you need for the desired grade. If you do not succeed, you can still use points from the written test to get a less desirable grade.

Grade is determined by the totality of points you earn as follows:

Rules:

1. Only students having an assessment are eligible to participate at an exam.
2. You can sign up for an exam only through KOS.
3. During the test you can only use a pen (not pencils), pocket calculator and your own brain. This among others means that other people's brains, textbooks, notes, and mobile phones are not allowed.
4. Written test should be written on blank papers of A4 size. Other formats will not be recognized.

Last modified: 6 November 2008