Algorithms and Data Structures
|| 07.10.2020 08:30 - 10:00
HS13 (if permitted by the Corona regulations)
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.
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
Any kind of questions are welcome.
Meetings: Thurdays 13:45 - 14:30, room S2 044 (if permitted by the Corona regulations)
Start: October 14
Exercise instructor: Ioana Cleopatra Pau (IoanaDOTPauATriscDOTjkuDOTat)
For further details and exercises click here.