|
|
Root number
|
451670 |
|
Semester
|
FS2020 |
|
Type of course
|
Lecture |
|
Allocation to subject
|
Computer Science |
|
Type of exam
|
not defined |
| 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. |
|
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 |
Monday 13:15-16:00 Weekly
|
|
Thursday 4/6/2020 10:15-12:00
|
|
Monday 5/10/2020 16:00-19:00
|
| |
| Rooms |
Hörsaal 1 001, Engehalde, E8
|
|
Hörsaal 099, Exakte Wissenschaften, ExWi
|
| |
| Students please consult the detailed view for complete information on dates, rooms and planned podcasts. |
User:
Öffentlicher Bereich
Support