Module description
Aims and Learning Outcomes
To introduce the basic concepts of discrete mathematics that are needed for the study of computer science.
On successful completion of this module, students will be able to work with sets, relations, functions, recursive structures, graphs, trees, basic combinatorial principles, discrete probability, finite automata and regular languages. Students should understand the role of these tools in modelling and be able to deploy them in some basic modelling tasks.
Syllabus
An indication of the type of topics:
- Sets
- Relations
- Functions
- Basic combinatorial principles
- Discrete probability
- Graphs
- Trees
- Finite automata
- Regular languages
Assessment details
Semester 1 only study abroad students will be required to take this exam in an alternative assessment format in the January exam period.
Full year study abroad students will be required to take this exam in person in January.