Malte Schwerhoff: Catalogue data in Autumn Semester 2022

Name Dr. Malte Schwerhoff
Dep. Informatik
ETH Zürich, CAB H 31.2
Universitätstrasse 6
8092 Zürich
Telephone+41 44 632 21 08
DepartmentComputer Science

252-0232-AALSoftware Engineering
Enrolment ONLY for MSc students with a decree declaring this course unit as an additional admission requirement.

Any other students (e.g. incoming exchange students, doctoral students) CANNOT enrol for this course unit.
6 credits13RF. Friedrich Wicker, M. Schwerhoff
AbstractThis course introduces both theoretical and applied aspects of software engineering. It covers:

- Software Architecture
- Informal and formal Modeling
- Design Patterns
- Software Engineering Principles
- Code Refactoring
- Program Testing
ObjectiveThe course has two main objectives:

- Obtain an end-to-end (both, theoretical and practical) understanding of the core techniques used for building quality software.
- Be able to apply these techniques in practice.
ContentWhile the lecture will provide the theoretical foundations for the various aspects of software engineering, the students will apply those techniques in project work that will span over the whole semester - involving all aspects of software engineering, from understanding requirements over design and implementation to deployment and change requests.
LiteratureWill be announced in the lecture
252-0836-00LComputer Science II Information 4 credits2V + 2UM. Schwerhoff, F. Friedrich Wicker
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
252-0864-00LEngineering Tool: Parallel and Concurrent Programming in C++ Information
All Engineering Tool courses are for MAVT-Bachelor students only.
0.4 credits1KM. Schwerhoff
AbstractThis course provides an introduction to parallel and concurrent programming, using C++. Basic challenges and concepts will be introduced and illustrated, and applied by students in small projects.
ObjectiveStudents develop a basic understanding of the advantages and pitfalls of concurrency, and gain an overview of the field and its concepts. They learn how to solve small problems using concurrent programs.
Prerequisites / NoticeThe course can only be passed if the projects are successfully implemented and submitted. If no or insufficient solutions are submitted, the course is considered failed.
252-0865-00LPreparatory Course in Computer Science Information 1 credit1PM. Schwerhoff
AbstractThe course provides an elementary introduction to programming with C++. Prior programming experience is not required.
ObjectiveEstablish an understanding of basic concepts of imperative programming and how to systematically approach programming problems. Students are able to read and write simple C++ programs.
ContentThis course introduces you to the basics of programming with C++. Programming means instructing a computer to execute a series of commands that ultimately solve a particular problem.

The course comprises the following:
- General introduction to computer science: development, goals, fundamental concepts
- Interactive self-study tutorial that provides an introduction to C++ and covers the following topics: variables, data types, conditional statements and loops
- Introduction to stepwise refinement as an approach to systematically solving programming problems
- Two small programming projects, to practically apply the studied fundamentals
Lecture notesAll teaching material is available online; an online development environment is used for the the programmig projects.