To introduce the notation, terminology, and techniques underpinning the discipline of Theoretical Computer Science.
To provide the mathematical foundation necessary for understanding datatypes as they arise in Computer Science and for understanding computation.
To introduce the basic proof techniques which are used for reasoning about data and computation.
To introduce the basic mathematical tools needed for specifying requirements and programs

(LO1) Understand how a computer represents simple numeric data types; reason about simple data types using basic proof techniques;

(LO2) Interpret set theory notation, perform operations on sets, and reason about sets;

(LO3) Understand, manipulate and reason about unary relations, binary relations, and functions;

(LO4) Apply logic to represent mathematical statement and digital circuit, and to recognise, understand, and reason about formulas in propositional and predicate logic;

(LO5) Apply basic counting and enumeration methods as these arise in analysing permutations and combinations.

(S1) Application of numeracy – manipulation of numbers, general mathematical awareness and its application in practical contexts.

(S2) Problem-solving – analysing facts and situations and applying creative thinking to develop appropriate solutions.

Number systems and proof techniques: natural numbers, integers, rationals, real numbers, prime numbers, proof by contradiction and proof by induction.
Approaches to describing collections of objects: sets and set operations, unary and binary relations, properties of binary relations, partial orders and equivalence relations, inverse relations, and compositions of relations.
Functions: properties of functions, inverse functions and compositions of functions, the pigeonhole principle.
Propositional logic: syntax and construction of formulas, semantics, interpretations and truth  tables, tautologies, contradictions, semantic consequence and logical equivalence.
Combinatorics: notation for sums, products, and factorials, Binomial coefficients, counting permutations, subsets, subsequences and functions.
Discrete Probability: sample spaces, events, conditional probability, independence, random variables and expectation.

Teaching Method 1 - Lecture
Description: Students will be expected to attend three hours of formal lectures in a typical week.
Attendance Recorded: Yes
Notes: Students are expected to spend at least one hour per week for completion of practical exercises
Unscheduled Directed Student Hours (time spent away from the timetabled sessions but directed by the teaching staff): 10

Teaching Method 2 - Tutorial
Description: One hour of tutorials accompany lectures in a typical week
Attendance Recorded: Yes