Time: Thurdays, 8:30 - 10:00

Room: HS 17, except: 06.10.22 in HF 9901 , 13.10.22 in HS 14, 17.11.22 in K 269D, 15.12.22 in HS16, 12.01.23 in HS 10

Room: HS 17, except: 06.10.22 in HF 9901 , 13.10.22 in HS 14, 17.11.22 in K 269D, 15.12.22 in HS16, 12.01.23 in HS 10

Algorithms and data structures will be presented that enable one to represent basic mathematical objects with the computer. Ideally, these algorithms/data structures can be combined in order to solve complex mathematical problems.

- Fundamental terms (algorithm, data structure, data type, abstract data type)
- Basic data structures (stack, queue, linked list, tree)
- Representation of sets (linked list, hash function, binary search tree, AVL tree)
- Representation of polynomials (dense, sparse)
- Sorting algorithms
- Graph algorithms

The lecture follows in parts the books

In addition, the following classical books might be useful for further reading:Datenstrukturen und Algorithmen: Güting

Algorithmen und Datenstrukturen: Wirth,

Any kind of questions are welcome.The Design and Analysis of Algorithms: Aho, Hopcroft und Ullman.

Regulary meetings: Thursdays 13:00 - 14:30

Start: November 24th

In addition, an introductory session will be given in October (to be announced)