Tentamen

Form

Die Klausuren und Prüfungen werden in der Regel schriftlich abgenommen und werden nach Ablauf des Semesters und vor Anfang des nächsten Semesters angeboten. Um die Sache nicht zu komplizieren sind die Klausure gleichzeitig auch Vordiplomsteilprüfungen / Prüfungen. Je nach Studienordnung können sie also unterschiedlich verwendet werden. Teilnehmen darf nur, wer die entsprechenden Zulassungsbedingungen erfühlt. Jeder Teilnehmer muss mit Erfolg an den Übungen (theoretisch und praktische) teilgenommen haben. In der alten Prüfungsordnung und der Bioinformatikprüfungsordnung kann man nur mit einem Schein an einer Prüfung teilnehmen. Den Schein kriegt man nach bestehen einer Klausur. In der neuen Prüfungsordnung gibt es keine Scheine mehr: jeder der die Übungen gut genug gemacht hat kann sich zur Prüfung anmelden.

Inhalt

Alles was in der Vorlesung besprochen ist gehört zum Stoff. Auch die gemachten Übungen gehöhren dazu. Dies geht gelegentlich ein Bißchen über dem Skript hinaus. Gelegentlich behandelt das Skript auch Sachen die in der Vorlesung nicht dran gekommen sind. Solche Themen müssen nicht studiert werden.

Unterstützung

Bei den Klausuren Prüfungen dürfen die Teilnehmer einen Taschenrechner mit endlich viel Speicher mitbringen (auf keinem Fall sollte eine komplette Kopie des Skript gespeichert werden können). Außerdem darf jeder ein doppelseitig benutztes A4 Blatt mit sovielen Notizen wie eben drauf passen mitbringen.

Dates

Klausur / Prüfung: Dienstag 27.07.04, 14.00-16.00, 3.28.
Klausur / Prüfung: Dienstag 05.10.04, 14.00-16.00, Kröllwitz, Chemie-HS 2.

Terminology

It is hard to know what i exactly expect you to write down. Generally speaking i will be happy if you show that you know what it is about, and when you once write left where you clearly mean right, this is not so serious.

Give a proof / prove: you are supposed to give a rather formal proof, similar to those given in the book.
Give / write down an algorithm: write down an algorithm rather precisely. Not in Java or C, but something that could easily be turned into code. Similar to most of the algorithms that are presented in the lecture nodes. Slightly less precise than in the book.
Explain how / describe an algorithm: a quite informal description, listing the main steps, but you are not expected to write pseudocode. This is about how you would explain an algorithm to a friend who has missed the lecture.
Explain why: similar to proving but less formal. Like describing an algorithm. In a proof i expect that if you use induction, you check the basis, write down a hypothesis, and proof that indeed you can get from k to k + 1. In an explanation it is ok to write down something like "using induction ... . But you must tell that we should use induction. Again, this is how you would explain something to a friend.
Name: just mention the right term or complexity, but don't explain how or why.

Type of Questions to Expect

It is hard to come with good questions. I will try to keep a balance between the following four categories of questions:

Near trivial questions as a warming up. For example, drawing a picture, giving a definition. These may be replaced by multiple-choice questions.
Knowledge: questions that should be easy when you have studied enough. I don't expect you to know too many facts.
Skill: a convincing proof, a complete complexity analysis, an estimate.
Insight: questions that build up on things that were done. I might first ask you to write down an algorithm for shortest path, and then ask you to give an improvement for the special case that ... .

Questions to Expect

There will be questions closely related to the questions we were doing during the exercise hours. Maybe also one of the questions that were at the end and possibly not treated explicitly.

Hidden in the lecture notes you might find hints on what i think is interesting. These are excellent questions for the "insight" category.

There will be some balance between the topics treated in the lecture.

There will certainly be a question about trees.
As part of a question there might be a proof by induction.
As part of a question there might be an analysis requiring that you are able to handle a simple recurrency relation.
As part of a question i might ask to give a lower bound proof.

I have worked out a few (parts of) example questions. You should not worry if you cannot make the questions, these are from another course, and not all topics treated there will be treated here.

Language

The questions are in German. For the answers, both English and German (and Dutch, Swedish, French) are allowed. As long as it is understandable i don't care about grammar or spelling.

This page was created by Jop Sibeyn.
Last update Monday, 07 March 05 - 12:35.
For any comments: send an email.