Final Reexam Event

The final oral exam in the course will be January 10, 2022. The project (if you have not completed it already) has deadline December 15, 2021 at noon. The project is the same as for the regular exam. You turn in everything (part 1 and 2) at the same time. Since SDU has changed teaching platform since this course was taught, please contact me early by email for directions on how to turn in.

Important Notice Regarding Reexams

This course is taught on an irregular schedule. Thus, you cannot rely on it running again next year. This is important wrt. possible reexam dates, should you need that. The first oral reexam will be held in August and your final attempt can be used in January next year. Specific dates will be announced later for the oral exam as well as for the project, which will have deadline some time earlier than the date for the oral exam.

There are two exam elements in this course:

• an oral exam, and
• a programming project.

You get one combined grade based on the two parts. The oral exam has highest weight.

Programming project

The programming project is in multiple parts with deadlines through the semester such that it is completed around the end of teaching.

Exam Project	Deadline
Part 1
Project description	Sunday, March 14, 2021, at 23:55
Part 2
Project description	Sunday, May 2, 2021, at 23:55

Oral exam

This exam is scheduled for Friday, June 4, 2021. More information will follow later regarding sequence and either room allocation or zoom details.

Since SDU is currently planning with exams at SDU, the below describes the exam procedure, provided that the exam does in fact take place at SDU. If the exam is later changed to zoom, the procedure will be updated with regards to zoom details, and possibly also with regards to questions and procedure. The curriculum will remain unchanged.

Procedure

The examination form is oral exam with preparation. When it is your turn for examination, you will draw a question. The list of questions can be found below. Then you will be placed alone in a preparation room. You will have approximately 25-30 minutes of preparation time and you are allowed to use any material that you are bringing yourself, excluding communication devices.

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 you have about 12-13 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.

Curriculum

The curriculum in the course consists of all the literature and exercises referenced on the weekly notes. You can rely on that you will only be examined in the parts of the material discussed at lectures and discussion sections.

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 sections listed below. Section 0 refers to the first part of each chapter before Section 1.

We have also covered material in Chapters 13, 14, and 15, in addition to some foundational topics, but I will not be asking you questions directly about those topics.

• 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

Questions

The below is the list of questions you draw from at the exam.

1. Convex Hull
2. Line Segment Intersection
3. Triangulation
4. Randomized Linear Programming
5. Kd-Trees
6. Range Trees
7. Point Location via Trapezoidal Maps
8. Voronoi Diagrams
9. Interval Trees
10. Priority Search Trees
11. Segment Trees
12. Binary Space Partitions

 

---