Home
About
Mobile
Open Content
Search
Module Overview
Description
Facilitators
Weblinks
Timetable
CS1231
DISCRETE STRUCTURES
2016/2017, Semester 1
School of Computing (Computer Science)
Modular Credits: 4
Tags:
--
Collapse All
Prerequisites
Top
A-level Mathematics or H2 Mathematics or MA1301 or MA1301FC or MA1301X
Synopsis
Top
This module introduces mathematical tools required in the study of computer science. Topics include: (1) Logic and proof techniques: propositions, conditionals, quantifications; (2) Relations and Functions: Equivalence relations and partitions, partially ordered sets, well-ordering principle, function equality, Boolean/identity/inverse functions, Bijection; (3) Mathematical formulationo of data models (linear model, trees, graphs); (4) Counting and Combinatoric: Pigeonhole Principle, Inclusion-Exclusion Principle, Number of relations on a set, number of injections from one finit set to another, Diagonalisation proof: An infinite countable set has an uncountable power set; Algorithmic proof: An infinite set has a countably infinite subset, subsets of countable sets are countable.
Assessment
Top
Final Exam
50%
Mid-term test
25%
Two assigments (each 10%)
20%
Tutorial attendance
5%
Preclusions
Top
MA1100
Workload
Top
3-1-0-3-3
Workload Components : A-B-C-D-E
A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of lab hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week