Teaching

• Module: Introduction to Computer Science (CH-232)
• Semester: Fall 2023
• Prerequisites: None
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30 (Research I, Room 87)
• TA (Group A): Aksay, Enes Yusuf
• TA (Group B): Borsos, Matheas-Roland
• TA (Group C): Dobrescu, Ana-Maria
• TA (Group D): Konstantinovikj, Darko
• TA (Group E): Madriaga, Ivanna Judea
• TA (Group F): Shopov, Georgi Krasimirov
• Class: Tuesday, 11:15-12:30 (RLH 172)
• Class: Friday, 08:15-09:30 (RLH 172)
• Class: Friday, 09:45-11:00 (RLH 172)
• General Tutorial: Tuesday, 20:00-21:00 (West Hall 2)
• Haskell Tutorial: Wednesday, 21:00-22:00 (West Hall 2)
• General Tutorial: Thursday, 20:00-21:00 (West Hall 2)
• 1st Module Exam: Wednesday, 2023-12-20 09:00-11:00 (SCC Halls 1-2 and 3-4)
• 2nd Module Exam: Tuesday, 2024-01-23 09:00-11:00 (ICC East Wing)

The module introduces fundamental concepts and techniques of computer science in a bottom-up manner. Based on clear mathematical foundations (which are developed as needed), the course discusses abstract and concrete notions of computing machines, information, and algorithms, focusing on the question of representation versus meaning in Computer Science.

The module introduces basic concepts of discrete mathematics with a focus on inductively defined structures, to develop a theoretical notion of computation. Students will learn the basics of the functional programming language Haskell because it treats computation as the evaluation of pure and typically inductively defined functions. The module covers a basic subset of Haskell that includes types, recursion, tuples, lists, strings, higher-order functions, and finally monads. Back on the theoretical side, the module covers the syntax and semantics of Boolean expressions and it explains how Boolean algebra relates to logic gates and digital circuits. On the technical side, the course introduces the representation of basic data types such as numbers, characters, and strings as well as the von Neuman computer architecture. On the algorithmic side, the course introduces the notion of correctness and elementary concepts of complexity theory (big O notation).

• Course: Secure and Dependable Systems (CO-566)
• Semester: Spring 2023
• Prerequisites: Operating Systems (CO-562)
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30, R.1-87
• TA: Bodaveli, Nikolozi
• Class: Tuesday, 15:45-17:00, RLH-172 Conrad Naber Lecture Hall
• Class: Thursday, 15:45-17:00, RLH-172 Conrad Naber Lecture Hall
• 1st Module Exam: 2023-05-23 18:00-20:00, ICC East Wing
• 2nd Module Exam: 2023-08-29 14:00-16:00, Research I, Lecture Hall

This module introduces students to the fundamentals of computer security and techniques used to build and analyze dependable systems. This is an important topic given that computer systems are increasingly embedded in everyday objects (such as light bulbs) and taking over important control functions (such as driving cars). Furthermore, computer systems control complex communication systems that form critical infrastructure of the modern globalized world. Proper protection of information requires an applied understanding of cryptography and how cryptographic primitives are used to secure data and information exchanges. The aim of this module is to make students aware of what types of security vulnerabilities may arise in computing systems and how to prevent, identify, and fix them.

• Module: Operating Systems (CO-562)
• Semester: Fall 2022
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30 (Research I, Room 87)
• TA (Group A): Aydin, Ahmed Hamza
• TA (Group B): Eshkiki, Hassan
• TA (Group C): Eshkiki, Hassan
• TA (Group D): Kvavilashvili, Luka
• TA (Group E): Sunar, Shishir
• Class: Tuesday, 14:15-15:30 (RLH 172)
• Class: Tuesday, 15:45-17:00 (RLH 172)
• Class: Thursday, 15:45-17:00 (RLH 172)
• Tutorial: Monday, 20:00-21:00 (West Hall 2)
• 1st Module Exam: Monday, 2022-12-12, 09:00-11:00, SCC Halls 1-4
• 2nd Module Exam: Monday, 2023-01-23, 09:00-11:00, ICC East Wing
• 3rd Module Exam: Thursday, 2023-08-24, 17:00-19:00, Research I, Lecture Hall

This module introduces concepts and principles used by operating systems to provide programming abstractions that enable an efficient and robust execution of application programs. Students will gain an understanding of how an operating system kernel manages hardware components and how it provides abstractions such as processes, threads, virtual memory, file systems, and inter-process communication facilities. Students learn the principles of event-driven and concurrent programming and the mechanisms that are necessary to solve synchronization and coordination problems, thereby avoiding race conditions, deadlocks, and resource starvation. The Linux kernel and runtime system will be used throughout the course to illustrate how key ideas and concepts have been implemented and how application programs can use them.

• Module: Bachelor Thesis and Seminar in Computer Science (CA-CS-800)
• Semester: Spring 2023
• Instructor: Amr Alanwar
• Instructor: Peter Baumann
• Instructor: Andreas Birk
• Instructor: Mathias Bode
• Instructor: Francesco Maurelli
• Instructor: Jürgen Schönwälder
• Instructor: Peter Zaspel
• Prerequisites: 30 CP of advanced modules earned, at least 20 CP from modules in the major

We expect that our students take the initiative and drive the process. How self-organized students work is part of the assessment. In terms of effort, please note that 1 CP equals ~25 hours, i.e., the module has an average workload of 375 hours.

• Module: Introduction to Computer Science (CH-232)
• Semester: Fall 2022
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30 (Research I, Room 87)
• TA (Group A): Devkota, Charchit
• TA (Group B): Güler, Sinem Bilge
• TA (Group C): Perial, Razvan Andrei
• TA (Group D): Schuster, Lars Florian
• TA (Group E): Stefanovska, Tea
• TA (Group Z): Banjade, Ayam (online students)
• Class: Tuesday, 11:15-12:30 (RLH 172)
• Class: Friday, 08:15-09:30 (RLH 172)
• Class: Friday, 09:45-11:00 (RLH 172)
• Tutorial H: Wednesday, 20:00-21:00 (East Hall 1)
• Tutorial Y: Thursday, 20:00-21:00 (online, Teams)
• 1st Module Exam: Saturday, 2022-12-17, 09:00-11:00, 11:30-13:30 (CLAMV and Lab 3)
• 2nd Module Exam: Monday, 2023-01-30, 09:00-11:00 (CLAMV and Lab 3)

The module introduces fundamental concepts and techniques of computer science in a bottom-up manner. Based on clear mathematical foundations (which are developed as needed), the course discusses abstract and concrete notions of computing machines, information, and algorithms, focusing on the question of representation versus meaning in Computer Science.

The module introduces basic concepts of discrete mathematics with a focus on inductively defined structures, to develop a theoretical notion of computation. Students will learn the basics of the functional programming language Haskell because it treats computation as the evaluation of pure and typically inductively defined functions. The module covers a basic subset of Haskell that includes types, recursion, tuples, lists, strings, higher-order functions, and finally monads. Back on the theoretical side, the module covers the syntax and semantics of Boolean expressions and it explains how Boolean algebra relates to logic gates and digital circuits. On the technical side, the course introduces the representation of basic data types such as numbers, characters, and strings as well as the von Neuman computer architecture. On the algorithmic side, the course introduces the notion of correctness and elementary concepts of complexity theory (big O notation).

• Module: Bachelor Thesis and Seminar in Computer Science (CA-CS-800)
• Semester: Spring 2022
• Instructor: Amr Alanwar
• Instructor: Peter Baumann
• Instructor: Andreas Birk
• Instructor: Fangning Hu
• Instructor: Francesco Maurelli
• Instructor: Jürgen Schönwälder
• Instructor: Peter Zaspel
• Prerequisites: 3rd year and 30 CP from CORE modules of the major

We expect that our students take the initiative and drive the process. How self-organized students work is part of the assessment. In terms of effort, please note that 1 CP equals ~25 hours, i.e., the module has an average workload of 375 hours.

• Course: Secure and Dependable Systems (CO-566)
• Semester: Spring 2022
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30, R.1-87
• TA: Hernández Salamanca, Mario Alberto
• Class: Tuesday, 15:45-17:00, R.1-53 Lecture Hall
• Class: Thursday, 15:45-17:00, R.1-53 Lecture Hall
• Class: Friday, 15:45-17:00, R.2-52 Lecture Hall
• 1st Module Exam: Monday, 2022-05-30, 09:00-11:00, R.1-53 Lecture Hall
• 2nd Module Exam: Thursday, 2022-08-25, 14:00-16:00, R.1-53 Lecture Hall

This module introduces students to the fundamentals of computer security and techniques used to build and analyze dependable systems. This is an important topic given that computer systems are increasingly embedded in everyday objects (such as light bulbs) and taking over important control functions (such as driving cars). Furthermore, computer systems control complex communication systems that form critical infrastructure of the modern globalized world. Proper protection of information requires an applied understanding of cryptography and how cryptographic primitives are used to secure data and information exchanges. The aim of this module is to make students aware of what types of security vulnerabilities may arise in computing systems and how to prevent, identify, and fix them.

• Module: Introduction to Computer Science (CH-232)
• Semester: Fall 2021
• Instructor: Jürgen Schönwälder
• Office Hours: Monday, 11:15-12:30 (Research I, Room 87)
• TA (Group A): Aydin, Ahmed Hamza
• TA (Group B): Bodaveli, Nikolozi
• TA (Group C): Panthi, Bivek
• TA (Group D): Ramos Alves, Julia
• Class: Tuesday, 11:15-12:30 (SAC Hall 3)
• Class: Friday, 08:15-09:30 (SAC Hall 3)
• Class: Friday, 09:45-11:00 (SAC Hall 3)
• Tutorial: Monday 18:00 to 19:00 (Group A, Ahmed Hamza Aydin, Teams)
• Tutorial: Tuesday 20:00 to 21:00 (Group D, Julia Ramos Alves, West Hall 6)
• Tutorial: Wednesday 18:00 to 19:00 (Group C, Bivek Panthi, Teams)
• Tutorial: Thursday 19:00 to 20:00 (Group B, Nikolozi Bodaveli, West Hall 6)
• 1st Module Exam: Friday, 2021-12-17, 09:00-11:00 (SCC Halls 3+4)
• 2nd Module Exam: Friday, 2022-01-28, 08:00-10:00 (ICC East Wing)

The module introduces fundamental concepts and techniques of computer science in a bottom-up manner. Based on clear mathematical foundations (which are developed as needed), the course discusses abstract and concrete notions of computing machines, information, and algorithms, focusing on the question of representation versus meaning in Computer Science.

The module introduces basic concepts of discrete mathematics with a focus on inductively defined structures, to develop a theoretical notion of computation. Students will learn the basics of the functional programming language Haskell because it treats computation as the evaluation of pure and typically inductively defined functions. The module covers a basic subset of Haskell that includes types, recursion, tuples, lists, strings, higher-order functions, and finally monads. Back on the theoretical side, the module covers the syntax and semantics of Boolean expressions and it explains how Boolean algebra relates to logic gates and digital circuits. On the technical side, the course introduces the representation of basic data types such as numbers, characters, and strings as well as the von Neuman computer architecture. On the algorithmic side, the course introduces the notion of correctness and elementary concepts of complexity theory (big O notation).