de | en

Efficient Algorithms and Data Structures (IN2003)

Course 0000000965 in WS 2018/9

General Data

Course Type lecture
Semester Weekly Hours 4 SWS
Organisational Unit Informatics 14 - Chair of Algorithms and Complexity (Prof. Albers)
Lecturers
Dates Mon, 10:00–12:00, Interims I 102
Fri, 10:00–12:00, Interims I 102

Assignment to Modules

Further Information

Courses are together with exams the building blocks for modules. Please keep in mind that information on the contents, learning outcomes and, especially examination conditions are given on the module level only – see section "Assignment to Modules" above.

additional remarks Basics of analysis of algorithms Fundamental data structures Algorithms for basic combinatorial problems
Links Course documents
TUMonline entry

Equivalent Courses (e. g. in other semesters)

SemesterTitleLecturersDates
WS 2017/8 Efficient Algorithms and Data Structures (IN2003) Fri, 10:00–12:00, Interims I 102
Mon, 10:00–12:00, Interims I 102
WS 2016/7 Efficient Algorithms and Data Structures (IN2003) Mon, 10:00–12:00, Interims I 102
Fri, 10:00–12:00, Interims I 102
WS 2015/6 Efficient Algorithms and Data Structures (IN2003) Mon, 10:00–12:00, Interims I 102
Fri, 10:00–12:00, Interims I 102
WS 2014/5 Efficient Algorithms and Data Structures (IN2003) Fri, 10:00–12:00, Interims I 102
Mon, 10:00–12:00, Interims I 102
WS 2013/4 Efficient Algorithms and Data Structures (IN2003) Fri, 10:00–12:00, Interims I 102
Mon, 10:00–12:00, Interims I 102
and singular or moved dates
WS 2012/3 Efficient Algorithms and Data Structures (IN2003)
Top of page