Page Content
to Navigation
Methodische und praktische Grundlagen der Informatik 2 - Algorithmen und Datenstrukturen im imperativen Stil (SS 14)
* Structure and concepts of the programming language
* Development and understanding of a program
* Programming in a small scale
* Complexity (Big O notation)
* Correctness (Hoare-Kalkül)
* Search and sort
* Data structures: Stack, Queue, Lists, Hashing, Searchtrees, B-tree, Realization of sets
* Graph algorithms (depth-first/breadth-first search, spanning tree, shortest path)
* Algorithms regarding optimization: Branch-and-Bound, Backtracking, Dynamic Programming, Greedy Algorithms, Heuristic Search
News
- The second date for the test is 02.10.2014 at 15:00 in room HE101.
- The test takes place on 25.07.2014 at 12:00 in room HE101.
- Registration for the tutorials in MOSES until 16.04. 18:00!
- For any open questions regarding ISIS, the worksheets or the tutorials
you can contact Carlo Fürst.
Overview
Lecturers: | Anja Feldmann |
Contact persons: | Carlo Fürst |
Event type: | Lecture with tutorial (VL+UE) |
SWS: | 6 |
LP (ECTS): | 9 |
Time: | Wednesday, 10am–12pm and Friday, 08am-10am |
First Meeting: | Lecture: 16.04.2014 |
Room: | Wednesday - H 0104 Friday - HE 101 |
Tutorial: | Registration for the tutorials in MOSES until 16.04. 18:00! |
Course ID: | 0401 L 215 |
Audience: | Bachelor students |
Prerequisites: | - |
Exam: | There is a "Portfolioprüfung". Worksheets 30% and a written test in the end 70% |
Further Information: | s. ISIS |
ISIS
If you are interested in attending, please make sure you are subscribed to the corresponding ISIS website to receive information and announcements.