2018/2019, Semester 2
School of Computing (Computer Science)
Modular Credits: 4
This module introduces mathematical tools required in the study of computer science. Topics include:
Logic and proof techniques.
Sets and functions.
Integers and induction.
Mathematical formulation of data models (trees, graphs).
Counting and Combinatoric.
A-level Mathematics or H2 Mathematics or MA1301 or MA1301FC or MA1301X
Two lectures per week. (Wednesday 9:00 am - 10:00 am, and Thursday 12:00 pm - 2:00 pm.)
One tutorial per week (11 sessions), starting from the week of 28 January, 2018.
Logic and Proofs
Propositional logic, Quantifiers, Nested quantifiers.
Sets and Functions
Sets operations, Functions, Cardinality.
Divisibility, Greatest common divisor, Fundamental theorem of arithmetic, the Euclindean algorithm, Fermat's little theorem.
Principle of Mathematical Induction.
Sum rule, Product rule, Permutations, Combinations, Binomial coefficients, Discrete Probability.
Simple graph, Digraph, Handshaking theorem, Bipartite graph.
Properties of trees, Binary search trees, Spanning trees, Minimum spanning trees.
A 2-hour final examination ( 6 May 2018, Monday, 9:00 am -11:00 am) -- 60%
Two 50-minute mid-semester tests (20% per test, week 7 onwards (including week 7), to be announced later) -- 40%
3 lecture hours per week.
1 tutorial hour per week.
6 hours for preparatory work and review by a student per week.