 |
| Detailed information |
| Original study plan |
Bachelor's programme Technical Mathematics 2025W |
| Learning Outcomes |
Competences |
| Students obtain basic knowledge about algorithms and data structures that are relevant to represent and manipulate basic mathematical objects and to combine them to solve complex mathematical problems. In addition, they get acquainted with mathematical tools to analyze the time and space complexity of algorithms.
|
|
| Skills |
Knowledge |
- Understanding of fundamental terms (algorithm, data structure, data type, abstract data type) [K2];
- Dealing with basic data structures (stack, queue, linked list, tree) [K2,K3, K4];
- Basic understanding of the different representations of sets [K2,K4] (bit-vector, linked list, hash-function, binary search tree, AVL tree) together with its peculiarities concerning space and time complexity [K4,K5];
- Dealing with polynomials in spare or dense representation using linked lists and hash tables [K4,K5];
- Exploring sorting algorithms (e.g, selection-sort, insertion-sort, merge-sort, and quick-sort) [K2,K4] with their space and time complexity [K5];
- Using the traversal of graphs to discover properties of graphs (cycles, shortest path, etc) [K2,K3]; understanding of more advanced algorithms, like finding shortest paths (Floyd, Dijkstra) [K2,K4];
- Using mathematical tools to explore the space and time complexity of algorithms [K4,K5].
|
Basic notions, representation of sets and polynomials, sorting algorithms, graph algorithms.
|
|
| Criteria for evaluation |
written exam at the end of the lecture
|
| Methods |
Blackboard and slides. In addition, homeworks are posed in the lecture that will be discussed in the exercise class.
|
| Language |
English and French |
| Study material |
The lecture is based in parts on
Datenstrukturen und Algorithmen von R.H. G"uting und S. Dieker (Teubner, 2003)
|
| Changing subject? |
No |
| Further information |
This lecture will run purely in presence mode.
In particular, there will be offered NO zoom connection.
Everything will be developed on the blackboard.
|
| Corresponding lecture |
(*)TM1PEKVADAT: KV Algorithmen und Datenstrukturen (3 ECTS)
|
|
