The exercises for the lecture Introduction to Combinatorial and Computational Geometry take place irregularly according to the preliminary schedule shown below. You will get the credit if you solve enough problems assigned during the semester. Each problem is evaluated according to its difficulty. Usually you will have four weeks to solve the problems and write your solutions. We will give you hints for the most difficult problems after three weeks. After we give you a hint for a problem, the amount of points that you can get for solving this problem reduces to half of the original maximum. If you hand in a better solution after the hint has been given, we add half of the points from your previous solution to the points from your new solution. It is not possible to get any points for solving the problems after a deadline has passed. Near the end of the semester, it is possible to assign a series of bonus problems to allow interested students earn the missing points.
During the exercise sessions, we will assign some easy problems to practice new definitions and notions from the lecture. Each of these problems is worth one point, which you get if you present us a correct solution by the end of the exercise session
You need 30 points to get credit for the course and 65 for automatically passing the exam. Generally, the more points you get, the easier the exam will be for you. If you wish to see your score on this page, please choose a nickname and write it on the paper with your solutions (as well as your name), or send it by e-mail. Without the nickname we will not make your score public.
You can also submit the solutions online in Moodle.
"...series2__123a3b5.pdf"
, where the beginning can be arbitrary and the end contains the list of solved problems.
In case of any questions, you can contact Jan Soukup (soukup at kam.mff.cuni.cz) or Jan Kynčl (kyncl at kam.mff.cuni.cz).
Series of problemsWinter semester
|
||||||||||||||||||||||||||
Schedule (winter semester)The schedule for presenting the solutions of the homework problems will be
ArchiveLinks |