- Official Course Descriptor (DRPS)
- DMMR on path
- Year Guide (common to all Informatics 2 courses)
- Teaching Staff
- Time and Places: lectures
- Course Schedule (and Lecture Slides)
- Weekly tutorial sheets
- Assessed coursework
- Piazza discussion forum
- Textbook and reading materials
- Study guide
- MOCK EXAM, and here are Solutions for the Mock Exam.
(
**Note: the exam for this course is open book.**) - Feedback

- 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

- 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 orders;

- 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.

This page is maintained by the course lecturers Kousha Etessami and Colin Stirling.

Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: school-office@inf.ed.ac.uk Please contact our webadmin with any comments or corrections. Logging and Cookies Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh |