252-0836-00L  Computer Science II

SemesterAutumn Semester 2022
LecturersM. Schwerhoff, F. Friedrich Wicker
Periodicityyearly recurring course
Language of instructionGerman



Courses

NumberTitleHoursLecturers
252-0836-00 VInformatik II2 hrs
Thu10:15-12:00HG E 7 »
M. Schwerhoff, F. Friedrich Wicker
252-0836-00 UInformatik II2 hrs
Fri16:15-18:00CHN D 42 »
16:15-18:00CHN D 44 »
16:15-18:00CHN D 46 »
16:15-18:00CHN D 48 »
16:15-18:00LFW B 3 »
16:15-18:00LFW C 1 »
16:15-18:00LFW C 11 »
16:15-18:00LFW E 13 »
21.12.16:15-18:00LFW C 1 »
M. Schwerhoff, F. Friedrich Wicker

Catalogue data

AbstractThe courses covers the foundations of design and analysis of algorithms and data structures, including graph theory and graph problems. It also introduces generic and parallel programming.
ObjectiveUnderstanding design, analysis and implementation of fundamental algorithms and data structures. Overview of the concepts of generic and parallel programming. Hands-on experience with implementing the aforementioned in C++.
Content* Asymptotic runtime (algorithmic complexity)
* Fundamental algorithmic problems, e.g. searching, sorting, shortest paths, spanning trees
* Classical data structures, e.g. search trees, balanced trees, heaps, hash tables
* Graph theory and graph problems
* Problem solving strategies as design patterns for algorithms, e.g. induction, divide and conquer, backtracking, dynamic programming
* Generic programming: C++ templates higher-order functions, lambdas, closures
* Parallel programming: (in)dependence of computations, parallelism and concurrency, shared memory, races, mutual exclusion, communication and synchronisation

Knowledge obtained in the lecture is deepened through practical and/or programming exercises (C++, Code Expert).
Lecture notesAll material (slides, lecture recordings, examples, exercises, etc.) will be published on the course website.
Literature* T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen,
Spektrum-Verlag, 5. Auflage, Heidelberg, Berlin, Oxford, 2011
* T. H. Cormen, C. E. Leiserson, R. Rivest, C. Stein: Algorithmen - Eine Einführung, Oldenbourg, 2010
* B. Stroustrup, The C++ Programming Language, 4th Edition, Addison-Wesley, 2013.
* B. Stroustrup, A Tour of C++, 3rd Edition, Addison-Wesley, 2022
Prerequisites / NoticePrerequisite: Computer Science I

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
In examination block forBachelor's Degree Programme in Electrical Engineering and Information Technology 2017; Version 07.04.2022 (Examination Block 1)
ECTS credits4 credits
ExaminersM. Schwerhoff, F. Friedrich Wicker
Typesession examination
Language of examinationGerman
RepetitionThe performance assessment is offered every session. Repetition possible without re-enrolling for the course unit.
Mode of examinationwritten 120 minutes
Additional information on mode of examinationDurch Bearbeitung der wöchentlichen Übungsserien kann ein Bonus von maximal 0.25 Notenpunkten erarbeitet werden, der an die Prüfung mitgenommen wird. Der Bonus ist proportional zur erreichten Punktzahl von speziell markierten Bonus-Aufgaben, wobei volle Punktzahl einem Bonus von 0.25 entspricht. Die Zulassung zu speziell markierten Bonusaufgaben kann von der erfolgreichen Absolvierung anderer Übungsaufgaben abhängen. Der erreichte Notenbonus verfällt, sobald die Vorlesung neu gelesen wird.
Die Prüfung wird voraussichtlich am Computer durchgeführt.
Written aidsSie dürfen maximal 4 A4-Blätter mit in die Prüfung nehmen. Inhaltliche und formale Anforderungen (Text, Bilder, ein-/doppelseitig, Ränder, Schriftgrösse, etc.) bestehen nicht. Elektronische Geräte bzw. digitale Unterlagen sind nicht erlaubt.

You may take up to 4 A4 sheets into the exam. There are no constraints regarding content and layout (text, images, single/double page, margins, font size, etc.). Electronic devices and digital documents are not allowed.
Online examinationThe examination may take place on the computer.
Distance examinationIt is not possible to take a distance examination.
If the course unit is part of an examination block, the credits are allocated for the successful completion of the whole block.
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

 
Main linkInformation
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

There are no additional restrictions for the registration.

Offered in

ProgrammeSectionType
Electrical Engineering and Information Technology BachelorExamination Block 1OInformation
Computer Science (General Courses)Computer Science for Non-Computer ScientistsZInformation
Quantum Engineering MasterElectivesWInformation