# Teaching

## HS16: Foundations of Computing I (AINF1110)

Lecturer: | Dr. Raphael Eidenbenz, Dr. Thomas Locher |

Assistents: | Matthias Thöny, Rafael Ballester |

Time: | Time slots TBA |

Room: | BIN TBA |

Language: | German/English |

OLAT: |
HS16 Foundations of Computing I |

Course Catalogue: |
Catalogue course link |

## Repetition

This module will be offered as a repetition only for students having failed the last offering in HS15. The module will consist of a few repetitorium sessions in the fall semester, dates to be announced soon.

### Overview

The goal of this course is to introduce the students with the formal logical and mathematical models as well as discrete structures that build the foundation of computing, programming and algorithms. Students will learn the fundamental concepts of logic and discrete mathematics as used in computer science and its applications.

The lecture is targeted at first-year students within their BSc in computer science or similar.

#### Literature

The lecture is based on the following book:

*Discrete Mathematics with Applications, by Susanna S. Epp, 4th Edition.*

#### Assessment

Participation and sucessfully passing the exercises during the semester as well as passing the written final exam.

#### Exercises

The exercise part will consist of assignments distributed and discussed in class, also using OLAT. Successful participation in the exercises is required for passing the course.

#### Final Exam

In order to be eligible for the final exam you need to successfully participate in the exercises. The lecture is completed when passing the written final exam. Place and date is published on the UZH course catalogue link and in OLAT (see links above).

#### Lecture material and content

The lecture material (slides, exercise..) will be available on the OLAT course website.

The course will cover topics such as, but not limited to, information and coding, boolean and digital logic, predicates, number theory, proving methods, sets, functions, relations, graphs and trees, and complexity.

Schedule |
Room |
Slides |
Exercises |

30.09.2016 | 0.K.02 | ||

14.10.2016 | 1.B.01 | ||

28.10.2016 | 0.K.02 | ||

11.11.2016 | 0.K.02 | ||

25.11.2016 | AFL-F-121 | ||

09.12.2016 | 0.K.02 |