Fundamentals of Algorithms and Data Structures
News
-
Information regarding the exam review of the repeat exam are available (see German website).
-
The results of the repeat exam are available (see German website).
-
New information regarding the exam review are available (see German website).
-
New information regarding the results of the exam as well as the exam review are available (see German website).
-
New information for the exam are available (see German website).
-
The deadline of the registration for the exam is Saturday, 30. June.
-
There will be no lecture on Thursday, 7. June (holiday).
-
New information regarding the exam is available (see German website).
-
There will be no lecture on Tuesday, 29. May (holiday).
-
There will be no lecture on Thursday, 17. May (holiday).
-
There will be no video broadcast of the lecture on Thursday, 3. May. Therefore, the lecture will take place in HS 1 only.
Lecture
- Lecturer:
Dr. Hanjo Täubig
- Module:
IN0007,
TUMonline
- Adience:
Students in Bachelor of Science in Computer Science (compulsory course)
Students in Bachelor of Science in Business Informatics (compulsory course)
Students in Bachelor of Science in Bioinformatics (compulsory course)
Students in Bachelor of Science in Computer Science: Games Engineering (compulsory course)
Students with minor subject Computer Science
Students in Master of Applied Computer Science
Students in Postgraduate Studies of Computer Science
- Time and Place:
Tuesday, 14:15–15:45, lecture hall MI HS 1 (Video broadcast in Interimshörsaal 1)
Thursday, 12:00–13:00, lecture hall MI HS 1 (Video broadcast in Interimshörsaal 1)
- Exercises:
2 hours per week exercises accompanying the lecture
Teaching assistant:
Jeremias Weihmann
- ECTS:
6 credits
- Prerequisits:
Basic knowledge in computer science
- Recommended for:
Fundamental knowledge in topic Algorithms and Data Structures
- Exams:
See here for more information.
- Contents:
The lectures are planned to deal in particular with the following topics:
- Foundations
- Basic data structures
- Advanced data structures
- Sorting and selecting
- Algorithms on graphs
- Algorithms on texts
- Data compression
- Related and advanced lectures:
Efficient algorithms and data structures
-
Slides
- Recordings:
Lecture recordings can be found in the archive of the TeleTeaching Tool.
For the content of the lecture of the 19th July 2012 see recordings of the 26th and 28th July 2011.
References
The content of the lectures is based on the following book:
Complementary and additional in-depth material can be found in the following books:
- Volker Heun:
Grundlegende Algorithmen - Einführung in den Entwurf
und die Analyse effizienter Algorithmen
2nd edition, Vieweg, 2003.
- Michael T. Goodrich, Roberto Tamassia:
Algorithm Design - Foundations, Analysis, and Internet Examples
John Wiley & Sons, 2002.
- Thomas H. Cormen, Charles E. Leiserson, Ronald
L. Rivest, Clifford Stein:
Introduction to Algorithms
3rd edition, MIT Press, 2009.
- Jon Kleinberg, Eva Tardos:
Algorithm Design
Pearson Education, 2005.
- Uwe Schöning:
Algorithmik
Spektrum Akademischer Verlag, 2001.
- Robert Sedgewick, Kevin Wayne:
Algorithms
4th edition, Addison-Wesley, 2011.
- Robert Sedgewick:
Algorithms in Java, Parts 1-4
3rd edition, Addison-Wesley, 2002.
- Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani
Algorithms
McGraw-Hill, 2008.
- Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani
Algorithms
McGraw-Hill, 2008.
Journal articles: