Fundamental Algorithms - WS 2004/05
Lecturer:
Dr. Kumar Neeraj Verma
Audience:
Time and Place:
- Monday 12-14 MI 02.07.023
- Tuesday 11-12 MI 02.07.014
First lecture on Monday Oct 25.
Contents:
- Fundamentals:
Models of Computation, Complexity Measures
- Sorting:
Bubble-Sort, Merge-Sort, Heap-Sort, Quick-Sort, Radix-Sort, Median-Algorithms,
Lower Bounds
- Searching:
Hashing, Search Tress, String Matching
- Graph Algorithms:
Transitive Closure, Shortest Path Problems, Minimum Spanning Trees
- Artithmetic Problems:
Euclidean Algorithm, Multiplication of Integers, ...
Tutorials:
There are no tutorials for this course. However to check your understanding
you can find exercises
on the
winter 2002/2003 lecture's website.
Final Exam:
Friday 18 February 2005, 12:00-14:00, room MI 02.07.014.
A hand-written sheet of paper (size A4, front and back page) may be used during the exam as helping material. No other material will be allowed.
The exam will be based only on topics covered in the online lecture notes.
Literature:
An extensive online script
of the winter 2002/2003 lecture is available via CSE's
Virtual Teaching Centre.
Textbooks:
- Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms
- Knuth: The Art of Computer Programming (Vol. 1-4, quite extensive)