DM819 - Computational Geometry
 
Fall 2024
Kim Skak Larsen

Home

Exam
Important Notice Regarding Reexams
As all elective courses, 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 the February/March reexam period, and your final attempt can be used the following summer. 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: 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, October 20, 2024, at 23:59
Part 2
Project description Sunday, December 8, 2024, at 23:59

Oral exam

This exam is scheduled for Thursday and Friday, January 9-10, 2025.

We may end up only using one of these days.

More information will follow later regarding sequence and room allocation.

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 and so-called AI tools which include generative transformers such as ChatGPT and many others; SDU does not allow you to use such aids for exams.

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 examiner 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 discussions between examiner and censor about the grade is included in the 25-30 minutes, so you have about 12-13 minutes for your own presentation.

Most of the questions below cover a whole lecture or more, so you will have to choose what 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. Notice that some chapters in the textbook start with some motivating example. Don't spend too much (or any) time on those. It is the core algorithms and data structures we would like to hear about.

Further Advice for an Oral Exam

Curriculum

TBA - it will essentially be all parts of the book and weekly notes that we have covered in the lectures and exercises.

Questions

TBA - likely almost one question per lecture topic.

 


   Data protection at SDUDatabeskyttelse på SDU