Discrete Mathematics and Mathematical Reasoning
This module runs in the first semester. Lecture hours are:
Monday 16:10-17:00, 50 George Square, G.03
Tuesday 10:00-10:50, David Hume Tower, Lecture Theatre C
Thursday 16:10-17:00, 50 George Square, G03
For Tutorial Groups see Groups on the course Learn page
Summary of intended learning outcomes
- Reason mathematically about basic (discrete) structures (such as numbers, sets, graphs, and trees)used in computer science.
- Use of mathematical and logical notation to define and formally reason
about mathematical concepts such as sets, relations, functions, and
integers, and discrete structures like trees, graphs, and partial
- Evaluate elementary mathematical arguments and identify fallacious reasoning
- Construct inductive hypothesis and carry out simple induction proofs;
- Use graph theoretic models and data structures to model and solve some
basic problems in Informatics (e.g., network connectivity, etc.)
- Prove elementary arithmetic and algebraic properties of the integers,
and modular arithmetic, explain some of their basic applications in
Informatics, e.g., to cryptography.
- Calculate the number of possible outcomes of elementary combinatorial processes such as permutations and combinations.
- Be able to construct discrete probability distributions based on
simple combinatorial processes, and to calculate the probabilities and
expectations of simple events under such discrete distributions.
Weekly tutorial sheet exercises
Discussed in weekly tutorial groups.
There are two handin courseworks
The final exam counts for 85%, and the assessed coursework counts for 15%.
This page is maintained by the course lecturers Kousha Etessami and Colin