 |
Lecturer:
Prof. Dr. Angelika Steger
Dr. Stefanie Gerke |
|
Area:
3 lectures per week in Bachelor of Science in Computer Science (compulsory
course)
3 lectures per week in complementary studies (compulsory course)
3 lectures per week in Master of Science in Computational
Science and Engineering (compulsory course) |
|
Time and Place:
Mon 9h 30 - 12:30, lecture hall 0220 |
|
Classes:
A 2 hours class is accompanying the lecture
Time and place: Wednesday 16.00-17.30, Room N1190 (held in german).
Teaching Assistant: Thomas Bayer
|
|
Exercise sheet for the Class on monday 3rd December
ps-file
pdf-file
|
|
Exercise sheet for the Class on monday 4th February
ps-file
pdf-file
|
|
Audience:
students in Computer Science (Bachelor of Science)
students in Computer Science (Complementary Studies)
students in Computational Science
and Engineering (Master of Science) |
|
Prerequisites:
Basic knowledge in computer science |
|
Recommended for:
Fundamental knowledge in the area of algorithms |
|
Contents:
-
Fundamentals
Models of Computation, Complexity Measures
-
Sorting
Insertion-Sort, Merge-Sort, Heap-Sort, Quick-Sort, Median-Algorithms,
Lower Bounds
-
Searching
Hashing, Search Tress
-
Graph Algorithms
Transitive Closure, Shortest Path Problems, Minimum Spanning Trees
-
Artithmetic Problems
Euclidean Algorithm, Multiplication of Integers, ...
|
|
Related and Advanced Lectures:
|
|
Lecture Notes:
Not available. |
|
References:
Cormen, Leiserson, Rivest; Introduction to Algorithms, MIT Press. |
|
Office Hours:
look here |
