General rules of the course

1a. Introduction to Mathematical Logic

1b. Applications of  Mathematical Logic

2. Functions and Inverse Functions

3a. Sequences and Limits

3b. Asymptotics: Big O notation and computational complexity

4a. Number theory: Integer division and prime numbers [only slides 9-15 required for the exam]

4b. Number theory: Modular arithmetic

[not required for the exam]

5. Cryptology [not required for the exam]

6a. Recurrence and Recursion: Mathematical Induction [not required for the exam]

6b. Recursion and Recurrence: Recursive Algorithms and Definitions

6c. Recurrence and Recursion: Solving linear recurrences

7a. Combinatorics: Basic Principles

7b. Combinatorics: Variations and combinations

7c. Combinatorics: Permutations with Repetitions, Partitions, Pigeonhole Principle

8a. Graph Theory: Introduction

8b. Graph Theory: Eulerian and Hamiltonian Cycles

8c. Graph Theory: Minimal Paths

9a. Trees: Introduction

9b. Trees: Spanning Trees