## Hermann Lehner: Catalogue data in Spring Semester 2020 |

Name | Dr. Hermann Lehner |

Address | Akademische Dienste (AkD) ETH Zürich, HG F 10.3 Rämistrasse 101 8092 Zürich SWITZERLAND |

Telephone | +41 44 632 20 58 |

hermann.lehner@akd.ethz.ch | |

Department | Computer Science |

Relationship | Lecturer |

Number | Title | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|

252-0029-00L | Parallel Programming | 7 credits | 4V + 2U | T. Hoefler, H. Lehner, M. Schwerhoff | |

Abstract | Introduction to parallel programming: deterministic and non-deterministic programs, models for parallel computation, synchronization, communication, and fairness. | ||||

Objective | The student should learn how to write a correct parallel program, how to measure its efficiency, and how to reason about a parallel program. Student should become familiar with issues, problems, pitfalls, and solutions related to the construction of parallel programs. Labs provide an opportunity to gain experience with threads, libraries for thread management in modern programming lanugages (e.g., Java, C#) and with the execution of parallel programs on multi-processor/multi-core computers. | ||||

252-0216-00L | Rigorous Software Engineering | 8 credits | 4V + 2U + 1A | F. Friedrich Wicker, H. Lehner, M. Schwerhoff | |

Abstract | This course introduces both theoretical and applied aspects of software engineering and analysis. It covers: - Software Architecture - Informal and formal Modeling - Design Patterns - Code Refactoring - Program Testing - Dynamic Program Analysis - Static Program Analysis | ||||

Objective | The course has two main objectives: - Understand, end-to-end (theoretical and practical), the core techniques for building quality software - Understand how to apply these techniques in practice | ||||

Content | Some of the core technical topics covered will be: - modeling and mapping of models to code - common code design patterns - functional and structural testing - dynamic and static analysis | ||||

Literature | Will be announced in the lecture. | ||||

252-0232-AAL | Software 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 credits | 13R | F. Friedrich Wicker, H. Lehner | |

Abstract | This 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 | ||||

Objective | The 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. | ||||

Content | While 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. | ||||

Literature | Will be announced in the lecture | ||||

252-0232-00L | Software Engineering | 6 credits | 2V + 1U | F. Friedrich Wicker, H. Lehner | |

Abstract | This 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 | ||||

Objective | The 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. | ||||

Content | While 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. | ||||

Lecture notes | no lecture notes | ||||

Literature | Will be announced in the lecture | ||||

252-0832-00L | Computer Science | 4 credits | 2V + 2U | H. Lehner, M. Schwerhoff | |

Abstract | The course covers the fundamental concepts of computer programming with a focus on systematic algorithmic problem solving. Taught language is C++. No programming experience is required. | ||||

Objective | Primary 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 scenes" when a program is translated and executed. Secondary goals are an algorithmic computational thinking, understanding the possibilities and limits of programming and to impart the way of thinking of a computer scientist. | ||||

Content | The course covers fundamental data types, expressions and statements, (Limits of) computer arithmetic, control statements, functions, arrays, structural types and pointers. The part on object orientation 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 notes | A script written in English will be provided during the semester. The script and slides will be made available for download on the course web page. | ||||

Literature | Bjarne 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. | ||||

252-0846-AAL | Computer Science II 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 credits | 9R | F. Friedrich Wicker, H. Lehner | |

Abstract | Together with the introductory course Informatics I this course provides the foundations of programming and databases. This course particularly covers algorithms and data structures and basics about design and implementation of databases. Programming language used in this course is Java. | ||||

Objective | Basing on the knowledge covered by lecture Informatics I, the primary educational objectives of this course are - constructive knowledge of data structures and algorithms amd - the knowledge of relational databases and When successfully attended the course, students have a good command of the mechanisms to construct an object oriented program. They know the typically used control and data structures and understand how an algorithmic problem is mapped to a sufficiently efficient computer program. They have an idea of what happens "behind the secenes" when a program is translated and executed. The know how to write database queries and how to design simple databases. 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. | ||||

Content | We discuss the paradigm of object oriented programming, typical data structures and algorithms and design principles for the design and usage of relational databases. More generally, formal thinking and the need for abstraction and importance of appropriate modelling capabilities will be motivated. The course emphasizes applied computer science. Concrete topics are complexity of algorithms, divide and conquer-principles, recursion, sort- and search-algorithms, backtracking, data structures (lists, stacks, queues, trees) and data management in relational data bases. | ||||

Lecture notes | The slides will be available for download on the course home page. | ||||

Literature | Robert Sedgewick, Kevin Wayne, Introduction to Programming in Java: An Interdisciplinary Approach, Addison-Wesley, 2008 T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms , 3rd ed., MIT Press, 2009 | ||||

Prerequisites / Notice | Prerequisites are knowledge and programming experience according to course 252-0845-00 Computer Science I (D-BAUG). | ||||

252-0846-00L | Computer Science II | 4 credits | 2V + 2U | F. Friedrich Wicker, H. Lehner | |

Abstract | Together with the introductory course Informatics I this course provides the foundations of programming. This course particularly covers algorithms and data structures. Programming languages used in this course are Java and Python. | ||||

Objective | Basing on the knowledge covered by lecture Informatics I, the primary educational objectives of this course are constructive knowledge of data structures and algorithms. When successfully attended the course, students have a good command of the mechanisms to construct an object oriented program. They know the typically used control and data structures and understand how an algorithmic problem is mapped to a sufficiently efficient computer program. 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. | ||||

Content | We discuss typical data structures and algorithms. More generally, formal thinking and the need for abstraction and importance of appropriate modeling capabilities will be motivated. Concrete topics are complexity of algorithms, divide and conquer-principles, recursion, sort- and search-algorithms, elementary dynamic data structures, algorithms on graphs. The concepts of the lectures will be motivated with applications. The programming languages used in the lectures and the practical exercises are Java and Python. For the exercises an online-compiler and online-submission system is used. | ||||

Lecture notes | The slides will be available for download on the course home page. | ||||

Literature | Robert Sedgewick, Kevin Wayne, Introduction to Programming in Java: An Interdisciplinary Approach, Addison-Wesley, 2008 T. Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms , 3rd ed., MIT Press, 2009 | ||||

Prerequisites / Notice | Prerequisites are knowledge and programming experience according to course 252-0845-00 Computer Science I (D-BAUG). | ||||

252-0848-00L | Computer Science I | 4 credits | 2V + 2U | M. Schwerhoff, H. Lehner | |

Abstract | The course covers the fundamental concepts of computer programming with a focus on systematic algorithmic problem solving. Taught language is C++. No programming experience is required. | ||||

Objective | Primary 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 scenes" when a program is translated and executed. Secondary goals are an algorithmic computational thinking, understanding the possibilities and limits of programming and to impart the way of thinking of a computer scientist. | ||||

Content | The course covers fundamental data types, expressions and statements, (Limits of) computer arithmetic, control statements, functions, arrays, structural types and pointers. The part on object orientation 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 notes | A script written in English will be provided during the semester. The script and slides will be made available for download on the course web page. | ||||

Literature | Bjarne 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. | ||||

252-0861-00L | Engineering Tool: Introduction to C++ Programming The Engineering Tool-courses are for MAVT Bachelor’s degree students only. | 0.4 credits | 1K | H. Lehner | |

Abstract | The event provides an introduction to programming in C++ by means of an interactive tutorial. | ||||

Objective | Build up an understanding of basic concepts of imperative programming. Reading and writing of first simple programs. | ||||

Content | In this course we will gently introduce you to the basics of computer programming. To program a computer means to give it a sequence of commands (a computer program) so that it exactly does what you want it to do. | ||||

Prerequisites / Notice | Belegung der Lerneinheit nur möglich, wenn das Programmierprojekt bearbeitet und abgegeben wird. Wird im Falle einer Belegung das Programmierprojekt nicht abgegeben, so wird die Lerneinheit als nicht bestanden bewertet («Abbruch»). |