**Algorithms and Data Structures**

### Wintersemester 2018/2019

#### Carsten.Schneider@risc.jku.at

*First lecture: * |
Thursday |
4.10.2018 08:30 - 10:00 ** room:
**HS12 |

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 : 15.2.2019 (Friday), 10:15 - 11:45, HS4

No auxilary means (except pencil and paper) are allowed. 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.

# Exercises

*Meetings: Thurdays 13:45 - 14:30, room HT 177F *

Start: October 4

Exercise instructor: Ioana Cleopatra Pau (IoanaDOTPauATriscDOTjkuDOTat)

For further details and exercises click here.