OverviewMathematical reasoning underpins many aspects of computer science and this module aims to provide the skills needed for other modules on the degree programme; we are not teaching mathematics for its own sake. Topics will include algebra, reasoning and proof, set theory, functions, statistics.
Introduction: revision of basic mathematical and algebraic concepts and techniques.
Set theory: sets and elements, union, intersection, complement and difference, subsets, tuples, Cartesian product, counting, powersets, strings.
Functions: functions as rules, identity function, composition, inverses, injections, bijections, surjections.
Relations: equivalence relations, partial and total orderings. • Statistics: sample mean and variance, Normal and Poisson distributions.
This module appears in:
2 lectures and 1 class per week (1 hour class for those in possession of A-level mathematics, 2 hour class for those who are not)
Method of assessment
50% coursework and 50% unseen closed-book examination
Clarke G & Cook D, A basic course in statistics, Hodder Arnold, 1998.
Croft & Davison, Foundation Maths, Prentice Hall, 2010.
Dean N, The Essence of Discrete Mathematics, Prentice Hall.
Nissanke N, Introductory Logic and Sets for Computer Scientists, Addison Wesley.
Page SG, Mathematics: a second start, Ellis Horwood, 1986.
On successful completion of the module, student will:
- Have gained the algebraic understanding and manipulation skills required for the mathematics that underpins computer science
- Have developed a knowledge and understanding of, and the ability to apply the mathematical principles and concepts behind topics that comprise the CS programmes
- Have developed formal reasoning skills that will be required elsewhere in the degree programmes in which this module is taken