The spring semester 2021 will take place online until further notice. Exceptions: Courses that can only be carried out with on-site presence. Please note the information provided by the lecturers.

Felix Oliver Friedrich: Catalogue data in Autumn Semester 2017

Name Dr. Felix Oliver Friedrich
Address
Dep. Informatik
ETH Zürich, UNG F 14
Universitätstrasse 19
8092 Zürich
SWITZERLAND
Telephone+41 44 632 83 12
E-mailfelix.friedrich@inf.ethz.ch
URLhttps://people.inf.ethz.ch/felixf
DepartmentComputer Science
RelationshipLecturer

NumberTitleECTSHoursLecturers
252-0002-AALData Structures and Algorithms Information
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.
7 credits15RF. O. Friedrich
AbstractThis course is about fundamental algorithm design paradigms (such as induction, divide-and-conquer, backtracking, dynamic programming), classic algorithmic problems (such as sorting and searching), and data structures (such as lists, hashing, search trees). Moreover, an introduction to parallel programming is provided. The programming model of C++ will be discussed in some depth.
ObjectiveAn understanding of the design and analysis of fundamental algorithms and data structures. Knowledge regarding chances, problems and limits of parallel and concurrent programming. Deeper insight into a modern programming model by means of the programming language C++.
ContentFundamental algorithms and data structures are presented and analyzed. Firstly, this comprises design paradigms for the development of algorithms such as induction, divide-and-conquer, backtracking and dynamic programming and classical algorithmic problems such as searching and sorting. Secondly, data structures for different purposes are presented, such as linked lists, hash tables, balanced search trees, heaps and union-find structures. The relationship and tight coupling between algorithms and data structures is illustrated with geometric problems and graph algorithms.

In the part about parallel programming, parallel architectures are discussed conceptually (multicore, vectorization, pipelining). Parallel programming concepts are presented (Amdahl's and Gustavson's laws, task/data parallelism, scheduling). Problems of concurrency are analyzed (Data races, bad interleavings, memory reordering). Process synchronisation and communication in a shared memory system is explained (mutual exclusion, semaphores, monitors, condition variables). Progress conditions are analysed (freedom from deadlock, starvation, lock- and wait-freedom). The concepts are underpinned with examples of concurrent and parallel programs and with parallel algorithms.

The programming model of C++ is discussed in some depth. The RAII (Resource Allocation is Initialization) principle will be explained. Exception handling, functors and lambda expression and generic prorgamming with templates are further examples of this part. The implementation of parallel and concurrent algorithm with C++ is also part of the exercises (e.g. threads, tasks, mutexes, condition variables, promises and futures).
LiteratureCormen, Leiserson, Rivest, and Stein: Introduction to Algorithms, 3rd ed., MIT Press, 2009. ISBN 978-0-262-03384-8 (recommended text)

Maurice Herlihy, Nir Shavit, The Art of Multiprocessor Programming, Elsevier, 2012.
B. Stroustrup, The C++ Programming Language (4th Edition) Addison-Wesley, 2013.

B. Stroustrup, The C++ Programming Language (4th Edition) Addison-Wesley, 2013.
Prerequisites / NoticePrerequisites:
Lecture Series 252-0835-00L Informatik I or equivalent knowledge in programming with C++.

Please note that this is a self study (virtual) course, which implies that (in the autumn semester) there are no physical lectures or exercise sessions offered. If you want to attend the real course, please go to 252-0002-00L in the spring semester.
252-0286-00LSystem Construction Information 4 credits2V + 1UF. O. Friedrich
AbstractMain goal is teaching knowledge and skills needed for building custom operating systems and runtime environments. Relevant topics are studied at the example of sufficiently simple systems that have been built at our Institute in the past, ranging from purpose-oriented single processor real-time systems up to generic system kernels on multi-core hardware.
ObjectiveThe lecture's main goal is teaching of knowledge and skills needed for building custom operating systems and runtime environments.

The lecture intends to supplement more abstract views of software construction, and to contribute to a better understanding of "how it really works" behind the scenes.
ContentCase Study 1: Embedded System
- Safety-critical and fault-tolerant monitoring system
- Based on an auto-pilot system for helicopters

Case Study 2: Multi-Processor Operating System
- Universal operating system for symmetric multiprocessors
- Shared memory approach
- Based on Language-/System Codesign (Active Oberon / A2)

Case Study 3: Custom designed Single-Processor System
- RISC Single-processor system designed from scratch
- Hardware on FPGA
- Graphical workstation OS and compiler (Project Oberon)

Case Study 4: Custom-designed Multi-Processor System
- Special purpose heterogeneous system on a chip
- Masssively parallel hard- and software architecture based on message passing
- Focus: dataflow based applications
Lecture notesPrinted lecture notes will be delivered during the lecture. Slides will also be available from the lecture homepage.
252-0835-AALComputer Science I Information
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.
4 credits9RF. O. Friedrich
AbstractThe course covers the fundamental concepts of computer programming with a focus on systematic algorithmic problem solving. Teached language is C++. No programming experience is required.
ObjectivePrimary educational objective is to learn programming with C++. When successfully attended the course, students have a good command of the mechanisms to construct a program. They know the fundamental control and data structures and understand how an algorithmic problem is mapped to a computer program. They have an idea of what happens "behind the secenes" when a program is translated and executed.
Secondary goals are an algorithmic computational thinking, undestanding the possibilities and limits of programming and to impart the way of thinking of a computer scientist.
ContentThe course covers fundamental data types, expressions and statements, (Limits of) computer arithmetic, control statements, functions, arrays, structural types and pointers. The part on object orientiation deals with classes, inheritance and polymorphy, simple dynamic data types are introduced as examples.
In general, the concepts provided in the course are motivated and illustrated with algorithms and applications.
LiteratureBjarne Stroustrup: Programming:Principles and Practice Using C++, Addison-Wesley, 2014
Stephen Prata: C++ Primer Plus, Sixth Edition, Addison Wesley, 2012
Andrew Koenig and Barbara E. Moo: Accelerated C++, Addison-Wesley, 2000
Bjarne Stroustrup: The C++ Programming Language (4th Edition) Addison-Wesley, 2013
Bjarne Stroustrup: The Design and Evolution of C++, Addison-Wesley, 1994
252-0835-00LComputer Science I Information 4 credits2V + 2UF. O. Friedrich
AbstractThe course covers the fundamental concepts of computer programming with a focus on systematic algorithmic problem solving. Teached language is C++. No programming experience is required.
ObjectivePrimary educational objective is to learn programming with C++. When successfully attended the course, students have a good command of the mechanisms to construct a program. They know the fundamental control and data structures and understand how an algorithmic problem is mapped to a computer program. They have an idea of what happens "behind the secenes" when a program is translated and executed.
Secondary goals are an algorithmic computational thinking, undestanding the possibilities and limits of programming and to impart the way of thinking of a computer scientist.
ContentThe course covers fundamental data types, expressions and statements, (Limits of) computer arithmetic, control statements, functions, arrays, structural types and pointers. The part on object orientiation deals with classes, inheritance and polymorphy, simple dynamic data types are introduced as examples.
In general, the concepts provided in the course are motivated and illustrated with algorithms and applications.
Lecture notesA script written in English will be provided during the semeter. The script and slides will be made available for download on the course web page.
LiteratureBjarne Stroustrup: Einführung in die Programmierung mit C++, Pearson Studium, 2010
Stephen Prata, C++ Primer Plus, Sixth Edition, Addison Wesley, 2012
Andrew Koenig and Barbara E. Moo: Accelerated C++, Addison-Wesley, 2000.
Prerequisites / NoticeFrom AS 2013, an admission to the exam does not any more formally require an attending of the recitation sessions. Handing in solutions to the weekly exercise sheets is thus not mandatory, but we strongly recommend it.

Examination is a one hour-long written test.
252-0845-00LComputer Science I Information 5 credits2V + 2UH. Lehner, F. O. Friedrich
AbstractThe course covers the basic concepts of computer programming.
ObjectiveBasic understanding of programming concepts. Students will be able to write and read simple programs and to modify existing programs.
ContentVariablen, Typen, Kontrollanweisungen, Prozeduren und Funktionen, Scoping, Rekursion, dynamische Programmierung, vektorisierte Programmierung, Effizienz.
Als Lernsprachen werden Java und Matlab verwendet.
LiteratureSprechen Sie Java?
Hanspeter Mössenböck
dpunkt.verlag
252-0846-AALComputer Science II Information
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.
4 credits9RF. O. Friedrich
AbstractIntroduction to programming in Java. Procedural foundations of programming and outlook to object oriented programming. Variables, types, assignments, control structures (branch, loop), data structures, algorithms, line graphics, graphical user interface. Writing small programs. Working with a professional programming environment (Eclipse).
ObjectiveThe students will be able to write simple programs and to modify existing programs.
ContentThis course offers an introduction to variables, control structures (branch, loop), algorithms and data structures, as well as an outlook to modularisation and object oriented techniques.
In the exercises students train programming skills (in the programming language JAVA). Students can solve the exercises on their own laptop or in the computer labs at ETH. The software used in this course runs on MS Windows, MacOS X and Linux.
Prerequisites / NoticePrerequisites:
252-0845-00 Computer Science I (D-BAUG)