2023/2024
Дискретная математика для разработки алгоритмов и программ
Статус:
Маго-лего
Когда читается:
1 модуль
Охват аудитории:
для всех кампусов НИУ ВШЭ
Преподаватели:
Кузнецов Степан Львович
Язык:
английский
Кредиты:
3
Контактные часы:
28
Course Syllabus
Abstract
This course includes the basics of mathematical logic, graph theory, combinatorics, and formal language theory. The emphasis is put upon the algorithmic side: mathematical results act as a support for effecient algorithms operating on graphs, strings, and, finally, parsing algorithms for regular expressions and contextfree grammars. The course is actually twofold: besides usual «chalk-and-blackboard» mathematical part, it also includes a practical one, i.e., implementing the algorithms discussed in the course. The students are supposed and encouraged to (but not restricted to) use the Python language. For the last part, parsing algorithms, PyBison is also welcome.