|
Lecturer:
Prof. Dr. Angelika Steger
|
|
|
Area:
4+2 lectures per week in
undergraduate studies
compulsory course
|
|
|
Time and Place:
Tue 8:30 - 10:00, lecture hall N1189
Fri 8:30 - 10:00, lecture hall S0314
|
|
|
Exercises:
1 hours per week central exercises accompanying the lectures
Wed 16h c.t. - 17:00, lecture hall N1190
2 hours per week tutorials accompanying the lectures.
Teaching Assistant: Michal Mnuk
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
|
|
|
Recommended for:
Vordiplom
|
|
|
Contents:
- Combinatorics
- Algebraic structures
- Graphs and algorithms
|
|
|
Related and Advanced Lectures:
Discrete Structures II
|
|
|
Lecture Notes:
probably
|
|
|
References:
-
Aigner:
-
Diskrete Mathematik
Vieweg, 1994. 44,- DM.
-
Kenneth H. Rosen:
-
Discrete mathematics and its applications
McGraw-Hill, 1995. Ca. 60,- DM.
-
Ronald L. Graham; Donald E. Knuth; Oren Patashnik:
-
Concrete mathematics : a foundation for computer science
Addison-Wesley, 1994. Ca. 94,- DM.
|
|
|
Office Hours:
look here
|
