course: Computer Science 2 - Algorithms and Datastructures

number:

141321

teaching methods:

lecture with integrated lab excercises

media:

Videoübertragung, internet, Moodle

responsible person:

Prof. Dr.-Ing. Tim Güneysu

Lecturers:

Prof. Dr.-Ing. Tim Güneysu (ETIT), B. Sc. Markus Krausz (ETIT)

language:

german

HWS:

4

CP:

5

offered in:

summer term

dates in summer term

• start: Tuesday the 21.04.2020
• lecture: siehe "Sonstiges"

Exam

All statements pertaining to examination modalities (for the summer/winter term of 2020) are given with reservations. Changes due to new requirements from the university will be announced as soon as possible.

goals

Participants will be provided with a systematic overview of principles, methods, concepts and notations of different algorithms and data structures. This knowledge, combined with hands-on exercises on the computer will enable students to develop, analyze and validate efficient programs and to translate, translate and execute them in the C++ programming language.

content

The lecture consists of four separate teaching units: The first block discusses basic concepts on the comparison and evaluation of algorithms. The second block introduces classical sorting algorithms (such as insertion sort, mergesort and quicksort). Classic search algorithms such as binary search or tree structures are presented in the third block. The last block provides an overview of graph algorithms and operations on strings. The lecture will be accompanied by exercises.

The lecture is based on the book "Algorithms and Data Structures - The Basic Toolbox" by Mehlhorn and Sanders (see http://www.springer.com/en/book/9783540779773).

requirements

keine

recommended knowledge

Contents of Lecture "Computer Science I"

miscellaneous

All materials are available via the Moodle Leaning Platform at https://moodle.ruhr-uni-bochum.de

Registration required.