|
Root number
|
451670 |
Semester
|
FS2023 |
Type of course
|
Lecture |
Allocation to subject
|
Computer Science |
Type of exam
|
Written exam |
Title |
Algorithms, Probability and Information |
Description |
This course introduces randomized algorithms and probabilistic methods, which play an important role in computer science today. In addition, basic notions from information theory are developed and the entropy of a random experiment as a measure for its information content is discussed. Randomized algorithms and probabilistic methods apply to many aspects of computing, such as communication, machine learning, data analysis and cryptology. The course starts with a brief introduction to discrete probability theory and presents important tools for assessing randomized algorithms and structures, such as Chernoff bounds and the probabilistic method. Algorithms on graphs and in number theory are discussed. Entropy is introduced as a measure for the information contained in an experiment and methods for coding and compressing data are presented.
Prior knowledge is needed about basic concepts of probability and combinatorics, equivalent to what is required by a Swiss Matura. Furthermore it is recommended to take the course "Discrete Mathematics" before or to have equivalent knowledge in the corresponding topics. |
ILIAS-Link (Learning resource for course)
|
No registration/deregistration in CTS (Admission in ILIAS possible).
ILIAS
|
Link to another web site
|
|
Lecturers |
Prof. Dr.
Christian Cachin, Teaching Staff, Faculty of Science ✉
|
ECTS
|
5 |
Recognition as optional course possible
|
Yes |
Grading
|
1 to 6 |
|
Dates |
Tuesday 14:15-17:00 Weekly
|
|
Tuesday 21/3/2023 14:15-17:00
|
|
Tuesday 13/6/2023 10:15-12:00
|
|
Tuesday 10/10/2023 14:00-17:00
|
|
Rooms |
Seminarraum 109, Engehalde, E8
|
|
Hörsaal A006, Exakte Wissenschaften, ExWi
|
|
Hörraum 101, Hauptgebäude H4
|
|
Students please consult the detailed view for complete information on dates, rooms and planned podcasts. |