Fundamental Algorithms
Lecturer: Prof. Dr. Christian Scheideler
Module information:
- Module II.2.1 (MuA)
- 3V + 2Ü SWS
- 6 ECTS Credits
Time and Location:
- Fri, 11-14 , F0.530
1st Exam:
- Tuesday, February 20th, 9:00-11:00 am, room L2
2nd Exam:
- Tuesday, March 20th, 9:00-11:00 am, room O1
Only a handwritten DIN A4 sheet (both sides can be used) will be allowed in the exam.
The inspection of the exam will take place on Monday, March 12, 2018, at 10:00 am in seminar room F2.211
Tutorials: (start in the third week of the semester)
- Mon 9-11 am, F1.110
- Wed 2-4 pm, F0.530
A homework sheet is published every Friday, starting in the first week of the semester. If you want your solutions to be corrected, you can hand them in before the Friday lecture one week later. The solutions will be discussed in the tutorials the week after.
One bonus point can be achieved by presenting a correct solution of an exercise in the tutorials. The bonus point improves the grade of a passed exam by a 1/3 step.
Contents:
The pdf versions of the slides can be found here. For the Powerpoint slides, log into Panda.
- Advanced Heaps
- Binomial Heaps
- Fibonacci Heaps
- Radix Heaps
- Applications - Advanced Search Structures
- Splay Trees
- (a,b)-Trees
- Patricia Tries
- Applications
- Graph Algorithms
- Shortest Paths
- Matchings
- Network Flows
- Ford-Fulkerson Algorithm
- Preflow-Push Algorithm
- Applications
- String Matching
- Knuth-Morris-Pratt Algorithm
- Boyer-Moore Algorithm
- Aho-Corasick Algorithm
Homework assignments: