Ralf Sasse: Catalogue data in Autumn Semester 2024 |
| Name | Dr. Ralf Sasse |
| Address | Lehre D-INFK ETH Zürich, CAB H 33.2 Universitätstrasse 6 8092 Zürich SWITZERLAND |
| Telephone | +41 44 632 53 89 |
| ralf.sasse@inf.ethz.ch | |
| Department | Computer Science |
| Relationship | Lecturer |
| Number | Title | ECTS | Hours | Lecturers | ||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 252-0832-00L | Computer Science I  | 4 credits | 2V + 2U | C. Cotrini Jimenez, R. Sasse | ||||||||||||||||||||||||||||||||
| 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. | |||||||||||||||||||||||||||||||||||
| Learning 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 | Lecture slides and all other material 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. | |||||||||||||||||||||||||||||||||||
| Competencies |
| |||||||||||||||||||||||||||||||||||
| 252-0836-00L | Computer Science II | 4 credits | 2V + 2U | R. Sasse, F. Friedrich Wicker | ||||||||||||||||||||||||||||||||
| Abstract | The 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. | |||||||||||||||||||||||||||||||||||
| Learning objective | Understanding 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 notes | All 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 / Notice | Prerequisite: Computer Science I | |||||||||||||||||||||||||||||||||||
| Competencies |
| |||||||||||||||||||||||||||||||||||
| 252-0856-AAL | Computer Science 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, R. Sasse | ||||||||||||||||||||||||||||||||
| 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. | |||||||||||||||||||||||||||||||||||
| Learning objective | Primary educational objective is to learn programming with C++. After having 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 like 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 polymorphism; 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 | Lecture slides and all other material 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 | |||||||||||||||||||||||||||||||||||
| Competencies |
| |||||||||||||||||||||||||||||||||||
| 252-0856-00L | Computer Science | 6 credits | 2V + 2U + 2P | F. Friedrich Wicker, R. Sasse | ||||||||||||||||||||||||||||||||
| 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. | |||||||||||||||||||||||||||||||||||
| Learning objective | Primary educational objective is to learn programming with C++. After having 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 like 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 polymorphism; 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 | Lecture slides and all other material 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 | |||||||||||||||||||||||||||||||||||
| Competencies |
| |||||||||||||||||||||||||||||||||||