course: Computer Science 2 - Algorithms and Datastructures

number:
141321
teaching methods:
lecture with integrated lab excercises
media:
computer based presentation
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 02.04.2019
  • lecture Tuesdays: from 14:15 to 15.45 o'clock in HID
  • tutorial (alternativ) Mondays: from 14:15 to 15.45 o'clock in ID 04/445
  • tutorial (alternativ) Tuesdays: from 12:15 to 13.45 o'clock in ID 04/471
  • tutorial (alternativ) Thursdays: from 12:15 to 13.45 o'clock in ID 03/653
  • tutorial (alternativ) Fridays: from 10:15 to 11.45 o'clock in ID 04/471
  • lab exercise (alternativ) Mondays: from 14:15 to 15.45 o'clock in ID 03/139
  • lab exercise (alternativ) Tuesdays: from 12:15 to 13.45 o'clock in ID 03/139
  • lab exercise (alternativ) Thursdays: from 12:15 to 13.45 o'clock in ID 03/139
  • lab exercise (alternativ) Fridays: from 10:15 to 11.45 o'clock in ID 03/139

Exam

Form of exam:written
Registration for exam:FlexNow
Date:29.07.2019
Begin:16:30
Duration:120min
Rooms : HGA 10,  HGA 20,  HGB 10,  HGD 10 ,  HGD 20 ,  HGD 30 ,  HIA ,  HIB
Individual appointments of students to each exam location will be issued by the responsible chair.

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.