»Search Algorithms«

Christian Schindelhauer

Exam

There are two exams for the certification of this lecture. The first one is the midterm exam. It is a voluntary written test over 45  minutes. It is scheduled for 8 Dec. 2004, 1.00 pm, in F1.110. The second test is an oral exam of about 25 minutes at the end of the lecture during the week of 7 Feb - 11 Feb 2005. For the second test registration (over the StudInfo-system) is mandatory

Final Exam

Registration for this exam is compulsory. (Nearly) all exams take place on

17/18 Feb. 2005, 9am-5pm, in F2.315.

The registration can be done on Monday, 31 Jan during the lecture (late registrations are also possible, yet undesirable). This oral exam covers either the second half of this lecture (7th-13th Lecture) or the complete lecture depending on the choice of the examinee at the beginning of the exam. As an auxiliary date for the exam we offfer

16 Mar. 2005, 9am-5pm, in F2.315.

If a participant has not successfully presented an exercise (including handing in a written version) the second period of the lecture then the eximinee will solve an exercise one hour prior to the exam and present the solution during the oral exam. The exercise will be chosed by the examiner.

Depending on the choice of the examinee the overall grade of the certificate for this lecture is either evaluated by the mean of the grades of the two exams or solely on the performance during the final exam. In the first case each of the tests covers one half of the lecture. In the second case the test covers the complete lecture.

Midterm Exam

Registration for this exam is not necessary. Simply, show up on

8 Dec. 2004, 1.00 pm, in F1.110.

This exam covers the first half of this lecture (1st-6th Lecture). Except writing utensils no extra material may be used (even scratch papers are not allowed).

The midterm exam consists of four parts (5 points each). One part checks general knowledge of the contents of the lecture. In the other three parts the participant has to show that he/she has understood the nature of the algorithms presented in this lecture. The best preparation for this test is to compute all exercises of this lecture.

If a participant has successfully presented an exercise (including handing in a written version), then the best three of the four parts will be choses for evaluation. You pass the test if you receive at least half of the points.

Later, the overall grade of the certificate for this lecture is evaluated by the mean of the grades of the two exams. Each of the tests covers one half of the lecture.

If a participants refrains from participating in the mid term exam, if he/she does not pass the midterm exam or if he/she decides to invalidate the outcome of this exam, then the oral exam will cover the complete lecture. For invalidating the midterm exam only a short (informal) statement of the examinee at the beginning of the oral exam (at the end of the semester) is necessary.

Exercises

If a student does not participate within the exercise classes, then

• he or she receives an extra examination question in the mid term exam
• he or she has to solve an exercise one hour prior to the final exam

A successful participation includes the presentation and written contribution of solutions for two exercises. One in the first half and one in the second half of the semester.