|
|
CT08 / Exam Information
Form
The exam will be an oral exam with no preparation time.
There is allocated 30 minutes per student, including time for evaluation.
Dates
There is a choice between the following two dates.
- January 13th
- January 20th
Please inform me by email as soon as possible which date you would
like to take the exam.
Questions
-
Time and Space complexity. Alternation and the Polynomial time Hierarchy.
(Lecture 1,2,3,4,5,6)
-
Parallel computation, Circuits and Lower Bounds.
(Lecture 7,8,9,10)
-
Randomized Computation. Expanders and error reduction.
(Lecture 11,12,13,14,15(first part))
-
Pseudorandom generators. Error correcting codes and hardness amplification.
(Lecture 15(last part),16,17,18,19)
-
Interactive proofs, Probabilistically Checkable Proofs and Inapproximability.
(Lecture 20,21,22,23,24)
The questions are very broad, so it is expected that you focus on one
particular part within the exam question picked. After your
presentation of this part, we will ask more broadly within the curriculum.
Schedule
The exams will be held in Turing-014
The schedule is as follows.
January 13th
- 13:00 20050713 David Kjær
- 13:30 20050900 Kasper Borup
- 14:00 20041572 Mark Greve
January 20th
- 10:00 20040819 Jakob Truelsen
- 10:30 20041089 Thomas Dueholm Hansen
- 11:00 20052051 Michael Kølbæk Madsen
- 11:30 20052440 Rasmus Ibsen-Jensen
- 13:00 20064778 Rocío Santillán Rodríguez
- 13:30 20085570 Claus Thrane
- 14:00 20051118 Casper Kejlberg-Rasmussen
|
