The module will introduce central concepts in the area of discrete mathematics.
The focus of the module is on basic mathematical concepts in discrete mathematics and on applications of discrete mathematics in algortihms and data structures. To show students how discrete mathematics can be used in modern computer science (with the focus on algorithmic applications).
This is an indicative module outline only to give an indication of the sort of topics that may be covered. Actual sessions held may differ.
Foundations: logic, sets, relations, functions.
The concept of algorithms and algorithmic thinking in problem solving
Summation techniques: manipulations of sums and multiple sums; finite calculus
Asymptotics and the bigOh notation
Manipulations with the floor and ceiling functions
By the end of the module, students should be able to:
Please see Talis Aspire link for most up to date list.
Acquiring basic knowledge in the new area (of discrete mathematics), including learning the key concepts of mathematical rigour and of the formal proof.
Critical thinking and creativity
Type  Required 

Lectures  30 sessions of 1 hour (30%) 
Seminars  9 sessions of 1 hour (9%) 
Private study  61 hours (61%) 
Total  100 hours 
Inclusive of private study, completion of problem sheets and revision.
No further costs have been identified for this module.
You do not need to pass all assessment components to pass the module.
Students can register for this module without taking any assessment.
Weighting  Study time  

Five assigned Problem Sheets  20%  
Each problem sheet is marked out of 10 and the overall coursework mark will be calculated as the average of the five marked assignments. 

Inperson Examination  80%  
CS146 Examinations (Summer)

Weighting  Study time  

Inperson Examination  Resit  100%  
CS146 Resit Examination (September)

feedback on problem sets in seminars.
This module is Core for: