Discrete Mathematics for Application and Algorithm Development

2024/2025

Учебный год

ENG

Обучение ведется на английском языке

3

Кредиты

Кто читает:

Департамент анализа данных и искусственного интеллекта

Статус:

Курс по выбору

Когда читается:

1-й курс, 1 модуль

Преподаватель

Кузнецов Степан Львович

Course Syllabus

Abstract

This course includes the basics of computational complexity, Boolean logic and graph theory. The emphasis is put upon the algorithmic side: mathematical results act as a support for effecient algorithms operating in Boolean logic and graph theory. 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, including PLY (Python Lex&YACC) for parsing Boolean formulae.