This is the coursework part for Algorithms, programming, and data representation
Topics
Students will solve object-oriented programming tasks in the Python programming language illustrate program structures with the help of a subset of the Unified Modelling Language
compare the efforts of different algorithms in terms of runtime and memory requirements implement basic combinatorial algorithms, especially search and sort algorithms, binary trees and basic graph algorithms understand and use recursion as a link between mathematical problem descriptions and programming implementation translate recursive problem descriptions into iterative ones
plan and process programming tasks in such a way that they are completed on time.
Syllabus:
C01 Explore local Anaconda and Google Colab
C02 Number Representations and Boolean Algebra in Python
C03 Branching and Iterations
C04 Recursion and Dictionaries
C05 Testing, Debugging, Exceptions, and Assertions
C06 Classes and Inheritance
C07 Searching and Sorting
C08 APIs and Libraries
C09 Searching and Sorting
C10 Graphs and Trees
C11 Hashtables
Confidence and social competence:
The students will
organize themselves independently into groups and coordinate the organizational and technical process of group work in consultation with each other
communicate and jointly develop solutions for theoretical questions and practical programming tasks within the framework of group tasks
plan and apply targeted measures for mutual quality assurance of the submitted solutions (check each other's group submissions)
are jointly responsible for the result of their group work, the evaluation of which applies equally to both group partners
(erwartete Hörerzahl original: 300, fixe Veranstaltung: nein)