The exam sequence is now available. Note that you cannot calculate a certain examination time from your slot in the sequence, since students before you may not show up. Thus, if you want to be certain to be examined, show up early. We are not expecting many no-shows for this particular exam, so expected examinations times will probably not change much, but of course, due to accumulation of effects, the probability of your examination time moving earlier increases during the day. We take a half hour lunch break close to noon.

- Jon Kingo Christensen
- Rojin Kianian
- Casper Kehlet Jensen
- Mikkel Levisen
- Diana Esi Hooper
- Uffe Thorsen
- Peter Severin Rasmussen
- Janine Weber
- Martin Østergaard Villumsen
- Martin Pedersen
- Jesper Beltoft Lund
- Yuan Liang
- Maria Nathalia Vinter Kristensen
- David Mortan Grøne Hammer
- Mathias Wulff Svendsen
- Jes Møllegård Hansen
- Jonas Malte Hinchely
- Rune Sostack Clausen
- Anders Busch
- Kristine Vitting Klinkby Knudsen

After the preparation time, the actual exam
takes place. This part also lasts approximately
25-30 minutes. You should start by presenting material
related to the question you drew.
Aim for a reasonably high pace and focus
on the most interesting material related to the
question.
You may bring a short list of keywords for the
actual exam to remember what you have decided to
present. Thus, you are *not* supposed to use note
material, textbooks, transparencies, computer, etc.
for this part.

We, the examinator and the censor, will supplement with specific questions when appropriate, and after a while, we will end the discussion of the exam question that you drew and turn to material from other parts of the curriculum. Note that all of this as well as discussion between examinator and censor about the grade is included in the 25-30 minutes, so do not count on more than 15 minutes for your own presentation.

Some of the questions below are very broad, so you must select the material you choose to cover. You will of course also be evaluated based on your selection of material. If you only present the simplest material, you limit the grade you can obtain. On the other hand, a good presentation of the simple material is better than a poor presentation of the harder material. For most questions, it is natural to first sketch the algorithm or data structure and then present essential elements of the analysis. In most cases, a complete treatment of the analysis is the harder part of the question, but will therefore also enable you to demonstrate the best understanding of the material.

On the other hand, some of the questions are fairly narrow. If you think you have too little material, you are welcome to continue with material from a related question.

Though it will not be a something that you will be examined in directly, you are of course expected to know topics from courses that are prerequisites for this course.

With regards to the material in the book other than exercises, we have covered the following (Section 0 refers to the first part of each chapter before Section 1):

- Sections 1.0-1.2
- Sections 2.0-2.2
- Sections 3.0-3.3
- Sections 4.0-4.4
- Sections 5.0-5.6
- Sections 6.0-6.3
- Sections 7.0-7.2
- Sections 10.0-10.3
- Sections 12.0-12.3
- Sections 14.0-14.3

- Convex Hull
- Line Segment Intersection
- Triangulation
- Randomized Linear Programming
- Kd-Trees
- Range Trees
- Point Location via Trapezoidal Maps
- Voronoi Diagrams
- Interval Trees
- Priority Search Trees
- Segment Trees
- Binary Space Partitions
- Quadtrees

Last modified: Mon Jan 11 22:15:08 CET 2016 Kim Skak Larsen (kslarsen@imada.sdu.dk)