Fundamental Algorithms (CSE) (IN2157)
Course 0000001565 in WS 2018/9
General Data
Course Type | lecture |
---|---|
Semester Weekly Hours | 2 SWS |
Organisational Unit | Informatics 7 - Chair of Theoretical Computer Science (Prof. Esparza) |
Lecturers |
Jan Kretinsky Tobias Meggendorfer |
Dates |
Assignment to Modules
-
IN2157: Grundlegende Algorithmen (CSE) / Fundamental Algorithms
This module is included in the following catalogs:- Focus Area Imaging in M.Sc. Biomedical Engineering and Medical Physics
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 complexity analysis - elementary data structures (lists, queue, stack) - generic collection types in Java - binary trees and traversal algorithms - binary search trees and balanced trees (AVL trees, B-trees) - priority queues - sor |
---|---|
Links |
Course documents Additional information TUMonline entry |