The course MS-A0402 is given in Period 4, starting with exercise sessions on Monday 24.2 and Tuesday 25.2.
Discrete Mathematics is the mathematics of finite and countable structures, or loosely speaking the mathematics of sets where there is no notion of "convergence". Methods from discrete mathematics play a large role in many other subjects, in particular
in computer engineering and data science. In this course we cover the foundations of discrete mathematics (graphs, enumeration, modular arithmetic) as well as as the foundations of all mathematics on university level (set logic and proof techniques).
We also study some modern applications of the theory, in cryptography and networks theory.
The course is suitable for all Aalto students; no other prerequisites than high school mathematics are necessary.
Welcome on board!
- Homework + final exam. In this case, the best four (out of five) homework scores are counted, and account together for 40% of the grade. The remaining 60% is determined by the final exam. Homeworks are reported in writing, and graded in the second
exercise session of each week. To get points from the homework, it is thus necessary to participate in the exercise sessions.
- Course exam. In this case, the exam result directly determines the grade.
26.2. Sets (Hammack 1)
27.2. Formal logic (Hammack 2)
4.3. Relations (Hammack 11)
5.3. Functions and cardinalities (Hammack 12, 13)
11.3. Enumerative combinatorics (Rosen 6.1-4)
12.3. Inclusion/exclusion (Hammack 8.5-6)
18.3. Graphs, trees, and circuits (Rosen 10.2-3)
19.3. Permutations ()
25.3. Permutations ()
26.3. Diophantine equations ()
1.4. Modular arithmetic ()
2.4. Repetition and curiosities