"- Notations of algorithms (structograms, activity diagrams, etc.); - search algorithms and sorting algorithms; - Basic data structures (lists, trees, heaps); - algorithmic problem solving (z.B. brute-force search, greedy algorithm, recursion, divide and conquer, ...); - deliberations on improving algorithmic efficiency"
Project Management & IT (Bachelor)
Language of instruction
At the end of the module, students will be able to apply basic aspects of theoretical informatics, finding an algorithmic solution to solve a given problem and correctly illustrate the solution in a graphic notation.