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.

Written exam: February 03 (Friday) 2023, 12:30-14:00, HS 08.

For the preparation the Exercises.pdf might be useful.

Content of the lecture:

• 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

Datenstrukturen und Algorithmen: Güting

In addition, the following classical books might be useful for further reading:

Algorithmen und Datenstrukturen: Wirth,

The Design and Analysis of Algorithms: Aho, Hopcroft und Ullman.

Any kind of questions are welcome.

Exercise class

Exercise instructor: Ioana Cleopatra Pau (IoanaDOTPauATriscDOTjkuDOTat)

Note: Instead of 14 sessions with 45 minutes, 7 sessions with 90 minutes will be offered via zoom

Regulary meetings: Thursdays 13:00 - 14:30
Start: November 24th

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

For further details and exercises click here.