Course co-ordinator(s): John See (Malaysia).
Aims:
To provide an introduction to, and grounding in, the basic principles and techniques of logic and discrete mathematics that are fundamental to Computer Science.
Detailed Information
Course Description: Link to Official Course Descriptor.
Pre-requisites: none.
Location: Malaysia.
Semester: 1.
Syllabus:
Set Theory and Combinatorics:Set algebra, Elementary counting methods, Permutations and Combinations, The InclusionExclusion Principle. Congruences and affine ciphers
Functions and relations, total and partial, domain and range, inverses of functions/relations.
Properties: Injection, surjection, bijection (for functions) and ordering/equivalence (relation). Reflexive/transitive/symmetric closures.
Integer division and modular arithmetic
Recurrence Relations :Solving problems by iteration, First and second order recurrence relations.
Propositional logic:Definition of the connectives by means of truth tables; truth tables of compound propositions; graphs for propositional formulae; order of precedence rules and brackets; contradictions, satisfiable formulae, tautologies; valid arguments; equivalence relations and logical equivalence;
First-order logic:relations; names and predicates; quantification; syntax; semantics; truth-trees.
Learning Outcomes: Personal Abilities
Demonstrate the ability to learn independently
Assessment Methods: Due to covid, assessment methods for Academic Year 2021-22 may vary from those noted on the official course descriptor. Please see the Computer Science Course Weightings and the Maths Course Weightings for 2020-21 Semester 1 assessment methods.
SCQF Level: 7.
Credits: 15.