Algorithms

Brief description

"- 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"

Mode of delivery

face to face

Type

compulsory

Recommended or required reading and other learning resources/tools

Robert Sedgewick: Algorithmen

Planned learning activities and teaching methods

Integrated course: lecture, case studies, discussion

Assessment methods and criteria

Assessment is based on the final exam as well as on the quality of students' assignments, presentations etc.

Prerequisites and co-requisites

none

Infos

Degree programme

Project Management & IT (Bachelor)

Cycle

Bachelor

ECTS Credits

2.00

Language of instruction

German

Curriculum

Full-Time

Academic year

2023

Semester

1 WS

Incoming

Yes

Learning outcome

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.

Course code

0387-17-01-VZ-DE-04