|
Lecturer:
Prof. Dr. Angelika Steger
|
|
|
Area:
4 lectures per week in
undergraduate studies
compulsory course
|
|
|
Time and Place:
Wed 9h c.t. - 10:45, lecture hall S0314
Fri 8:30 - 10:00, lecture hall S0314
Start: 3. May
End: 28. July
|
|
|
Exercises:
2 hours per week tutorials accompanying the lectures.
Organisational Matters:
Dr. Werner Meixner
Teaching Assistants:
Alexander Hall, Martin Raab, Thomas Schickinger
Course Certificate: To get a course certificate students must
get at least 40% on the homework assignments and
pass the final exam.
|
|
|
Audience:
undergraduate students of computer science
students with computer science as minor
|
|
|
Prerequisites:
1st year courses
Discrete Structures I
|
|
|
Recommended for:
Vordiplom
|
|
|
Contents:
Outline:
- Formal Languages and Automata Theory
- Computability and Decidability
- Efficient Data Structures
- Complexity Theory
|
|
|
Related and Advanced Lectures:
Efficient Algorithms and Datastructures I
Parallel Algorithms I
|
|
|
Lecture Notes:
Not available.
|
|
|
References:
-
John E. Hopcroft, Jeffrey D. Ullman:
-
Introduction to automata theory, languages, and computation
Addison-Wesley Publishing Company, Reading MA, 1979
-
Uwe Schöning:
-
Theoretische Informatik kurz gefaßt
B.I., Mannheim-Leipzig-Wien-Zürich, 1992
-
Ingo Wegener:
-
Theoretische Informatik
B.G. Teubner, Stuttgart 1993
|
|
|
Office Hours:
look here
|
