To introduce the foundational mathematics needed for Computing Science; To make students proficient in their use; To show how they can be applied to advantage in understanding computational phenomena.

Two 1-hour lectures per week; nine one-hour Tutorials held over the course of the semester.

None

None

1.5 hour examination (80%); plus assessed coursework (20%) and in-class quizzes 5%

It is the default expectation that all courses will offer opportunities for reassessment or deferred assessment. Where it is not possible to offer this in some assessment components, the grade achieved at the first attempt will be counted towards the final course grade, and any exceptions for this course are described below.

[No exceptions]

To introduce the foundational mathematics needed for Computing Science; To make students proficient in their use; To show how they can be applied to advantage in understanding computational phenomena.

By the end of this course students will be able to:

1. translate simple English sentences into the notation of predicate logic, set theory and relational algebra;

2. use predicate logic, set theory, and relational algebra to write assertions;

3. use laws to prove assertions in predicate logic, set theory, and relational algebra;

4. demonstrate an understanding of inductively-generated structures and proofs by induction;

5. deploy the basic concepts of combinatorics;

6. understand the basic principles of discrete probability theory and apply them to simple problems.