Contents: We begin with the notion of an algorithm, and we describe the cycle from problem statement to algorithmic solution to working code. We consider numerous examples that illustrate fundamental principles of algorithm design. In order to implement our algorithms, we introduce the functional programming language Haskell. Additionally, we explore the theoretical, technological, and organizational principles of computer systems. Topics covered include the binary representation of information in a computer, Boolean functions and their implementation as circuits, the design principles of CPUs, and the von-Neumann-architecture.
Prerequisites: We recommend that participants of this class attend the Brückenkurs Mathematical Foundations of Computer Science and Bioinformatics.
S. Thompson; Haskell: The Craft of Functional Programming; Addison-Wesley
F. Rabhi, G. Lapalme; Algorithms: A Functional Proramming Approach; Addison-Wesley
G. Hutton; Programming in Haskell; Cambridge University Press
A. Tanenbaum, J. Goodman; Computerarchitektur; Pearson Studium
Hs 1a Hörsaal
Hs 1b Hörsaal
22.02.2023 08:00 - 10:00
Gr. Hörsaal (Raum B.001)
03.04.2023 08:00 - 10:00
wöchentlich, ab 19.10.2022, 08:00 - 10:00 (16 Termine)
wöchentlich, ab 21.10.2022, 08:00 - 10:00 (16 Termine)