Exam
Grades are determined based on your result in a
written exam.
In the exam you can reach up to 40 points corresponding to
the following grades.
- [0,5) points: 5,0
- [5,11) points: 4,7
- [11,17) points: 4,3
- [17,19] points: 4,0
- (19,22] points: 3,7
- (22,24] points: 3,3
- (24,26] points: 3,0
- (26,28] points: 2,7
- (28,30] points: 2,3
- (30,32] points: 2,0
- (32,34] points: 1,7
- (34,36] points: 1,3
- (36,40] points: 1,0
10x10 assessments
In the course of the lecture, there will be app. 10 mini-tests of about
10 minutes each. The assessments are voluntarily, but allow you to obtain
a bonus for the exam depending on the
overall ratio of correct
answers.
- (.2,.4]: 0.5 points
- (.4,.6]: 1.0 points
- (.6,.8]: 1.5 points
- (.8,1]: 2.0 points
Programming Bonus
Implement the interactive protocol for deciding membership in QBF!
A correct implementation should be sent to kreiker@in.tum.de until June 25. It
will earn you 1 extra bonus point for the exam. The specification is rather
loose, feel free to add extra usability features. Your tool will
be evaluated according two a few test protocol runs including the one
shown in the lecture.
- You may use any reasonable programming language but you must clearly
document how to install and how to use it.
- Your task is in essence to implement the prover, while the
user should be the verifier.
- Your tool should take as a first input a quantified Boolean formula F.
- It should then compute all f_{i,j} polynomials and output f_{0,0}. It
is ok to implement an honest prover. Also it should suggest a prime number according to the proof.
- In each round, the user (verifier) shall suggest a new random number
according to the recursive scheme; your tool shall output the required
polynomial.
- In each step, the user must be able to accept or reject. After f_{n,n} is
output the user can only accept or reject.
Exercise sheets
Exercises are
voluntary and do not account for the final grade.
They are however highly recommended.
Contact
Teaching
