Discrete Mathematics

Course was designed and taught by Andrew Stankevich at ITMO University in 2017–19 (year2017, 1st–4th semesters).

Labs

1st semester

1. Boolean functions (statements (ru), solutions)
2. Algorithms of data compression (statements (ru), solutions)
3. Combinatorics (statements (ru), solutions)

2nd semester

4. Probability theory (statements (ru), solutions)
5. Finite-state machines (statements (ru), solutions)
6. Context-free grammars (statements (ru))

3rd semester

7. Hamilton cycles (statements (ru), solutions)
8. Matroids (statements (ru), solutions)
9. Matroid intersections (statements (ru))
10. Planar graphs (statements (ru), solutions)

4th semester

11. Generating functions (statements (ru), solutions)
12. Turing Machine (statements (ru), solutions)

Homeworks

• Problem list for DM 2017 autumn
• Problem list for DM 2018 spring
• Problem list for DM 2c 2018 autumn
• Problem list for DM 2c 2019 spring

Useful links

• "Дискретная математика" on wikiconspects (ru)
• "Теория вероятности" on wikiconspects (ru)
• "Теория формальных языков" on wikiconspects (ru)
• "Теория графов" on wikiconspects (ru)
• "Теория матроидов" on wikiconspects (ru)
• "Теория вычислимости" on wikiconspects (ru)