| Detailed information |
| Original study plan |
Bachelor's programme Electronics and Information Technology 2025W |
| Learning Outcomes |
Competences |
| Students know the characteristics of Algorithms and can write algorithms for small and medium-size problems on their own. Students know widespread data structures such as lists, trees, and graphs and can write algorithms to create and manipulate these data structures.
|
|
| Skills |
Knowledge |
Students can
- write specifications for algorithms (K5)
- write different types of algorithms based on a specification (K5)
- use stepwise refinement to deconstruct algorithms into multiple methods (K6)
- write recursive algorithms (K6)
- use different types of dynamic data structures to model complex data (K6)
- analyze, measure, and assess the complexity of algorithms (K5)
- sort data by using diverse sorting algorithms and understand the strengths and weaknesses of different sorting algorithms (K4)
- understand complex algorithms for exhaustion and optimization (K3)
|
- The term algorithm and classes of algorithms
- Algorithmic thinking
- Specifications
- Stepwise refinement methods
- Stateful algorithms
- Complexity of algorithms and programs
- Simple and structured data types
- Recursion
- Sorting algorithms
- Dynamic data structures
- Lists/List algorithms
- Trees/Tree algorithms
- Graphs/Graph algorithms
- Algorithms for exhaustion and optimization
|
|
| Criteria for evaluation |
Written exam at the end of the semester
|
| Methods |
The lecture mostly is based on algorithms in pseudo code. This allows learning algorithms independent of a concrete programming language.
Some parts of the lecture are supported by demo videos. Some algorithms are constructed on the blackboard or whiteboard step by step.
|
| Language |
German |
| Study material |
- Aho A.V., Hopcroft J.E., Ullman J.D.: Data Structures and Algorithms. Addison-Wesley 1983.
- Goodrich, M. T., Tamassia, R., and Goldwasser, M. H.: Data structures and algorithms in Java. John Wiley & Sons. 2014.
- Knuth D.E.: The Art of Computer Programming. Addison-Wesley 1973.
Band 1: Fundamental Algorithms.
Band 2: Seminumerical Algorithms.
Band 3: Sorting and Searching.
- Wirth, N.: Algorithms + Data Structures = Programs. Prentice-Hall. 1976.
|
| Changing subject? |
No |
| Further information |
The lecture is mainly based on slides. Slides and additional material will be made available for download in PDF format.
This lecture is linked with the related exercise to one didactic unit. The learning outcomes are reached by both lectures together.
|
| Corresponding lecture |
(*)MEBPFVOPIN1: VL Praktische Informatik 1 (3 ECTS)
|
