Fundamental Algorithms (CSE) (IN2157)

Welcome to the Fundamental Algorithms course offered in WS20.

Lecture

Thursday (16:00 - 18:00)

Due to covid-19, all lectures will be recorded!

Lecturers: Dr. Aljosa Osep

ECTS: 6

SWS: 4

Tutorial

Tuesdays (10:00-12:00)

Due to covid-19, all lectures will be held online.

Tuesdays (10:00-12:00)

Tutors: Aysim Toker, Qunjie Zhou

Content

Starting week: Nov. 16-20

• Lecture 1: Introduction to the lecture (Nov. 17-22)
• Lecture 2: Sorting I (Nov. 24-29)
• Lecture 3: Sorting II (Dec. 1-7)
• Lecture 4: Recurrences and master theorem (Dec. 8-14)
• Lecture 5: Searching (Dec. 15-21)
• Lecture 6: AVL trees (Jan. 5-11)
• Lecture 7: Hash tables (Jan. 11-18)
• Lecture 8: Parallel algorithms (Jan. 19-25)
• Lecture 9: Graphs (Jan. 26 - Feb. 1)
• Lecture 10: Weighted graphs (Feb. 2-8)
• Lecture 11: TBA graphs (Feb. 9-15)
• Lecture 12: NP-hard problems (Feb. 16-22)

Slides

The lecture material (lectures + slides) will be uploaded on moodle.

Moodle

We use Moodle for discussions and to distribute important information. Please check the News and Discussion boards regularly or subscribe to them. The slides and all material will also be posted on Moodle.

FINAL EXAM:

• Exam date: tba

Contact us

If you have any questions regarding the organization of the course, do not hesitate to contact us.

For questions on the syllabus, exercises or any other questions on the content of the lecture, we will use the Moodle discussion board.

Office hours

Due to covid-19, all office hours will be online.

External (non-TUM) Students

We want to provide access to our lecture for as many students as possible. Therefore, we ask external students that are not TUM students and do not have access to TUMonline to register to Moodle and send us their student information via email. We will then add you to our Moodle course where you will find addtional information and all the course material.