This lecture will cover the essential information that students needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Python implementations. The lecture will cover the following:
- Development of algorithm
- Searching and sorting algorithms
- Concept of Abstract Data Types (ADT)
- Abstract Data Types (linked lists, stacks, queues, sets, binary trees, balanced trees, B-trees, hash tables, graphs)
- Classes of algorithms (divide-and-conquer algorithms, search and sorting algorithms, graph algorithms, greedy algorithms, optimization algorithms)
- verantwortliche Lehrperson: Shoeb Joarder
- begleitende Lehrperson: Mohamed Amine Chatti