• Programming and computing basics
  

• Data structures
  

• Object orientation
  

• Python basic knowledge
  

• Computational Complexity
  

• Basic algorithms

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:

T01 Organization and Boolean Algebra
T02 Number Representations and Boolean Algebra
T03 Memory Organisation

T04 Decomposition, Abstraction, and Functions

T05 Recursion

T06 Object Oriented Programming

T07 Program efficency

T08 Searching and Sorting

T09 Graphs and Trees

T10 Hashtables (erwartete Hörerzahl original: 300, fixe Veranstaltung: nein)

Credits: 2,5