Last modified: 22 May 2019 17:07
This course provides a basiclevel introduction to some areas of Discrete Mathematics that are of particular relevance to Computing. The course starts with a simple introduction to formal languages (starting from Regular Expressions and FiniteState Automata); it continues with an introduction to Predicate Logic (assuming basic familiarity with Propositional Logic); it concludes with an introduction to probability, focussing on Bayesian reasoning.
Study Type  Undergraduate  Level  2 

Session  First Sub Session  Credit Points  15 credits (7.5 ECTS credits) 
Campus  None.  Sustained Study  No 
Coordinators 

Three main topics will be covered: 1. Introduction to formal languages: finitestate machines, regular expressions, Kleene's theorem, pushdown automata, contextfree languages. 2. Introductory statistics for computing: Probability, Combinations, Permutations, Bayes' rule; the noisy channel model; principles of descriptive and inferential statistics; principles of hypothesis testing (null hypothesis, type1 and type2 errors, etc). 3. Topics in logic and set theory, including and introduction to predicate logic; the cardinality of Infinite sets; Cantor's diagonal argument; simple abstract applications to computability. Throughout the course, there will be an emphasis on proof methods, including methods such as proof by mathematical induction, and proof by contradiction.
Information on contact teaching time is available from the course guide.
1st Attempt: 2hour written exam (75%). Continuous assessment, consisting of maths problems (25%) Resit: 2hour written exam (75%). The continuous assessment mark will be carried forward. (25%)
Marked coursework will be returned to students within 2 weeks of submission. Consequently, this will play a role as formative (as well as summative) asessment.
We have detected that you are have compatibility mode enabled or are using an old version of Internet Explorer. You either need to switch off compatibility mode for this site or upgrade your browser.