DISCRETE STRUCTURES (2013/2014, Semester 1) 

 MODULE OUTLINE Created: 17-May-2013, Updated: 17-May-2013
Module Code CS1231
Semester Semester 1, 2013/2014
Modular Credits 4
Faculty School of Computing
Department Computer Science
Timetable Timetable/Teaching Staff
Module Facilitators
ASSOC PROF Bressan, Stephane Lecturer
Consultation : Walk-in consultation every Friday from 12noon to 2pm in my office COM1-03-20
DR Low Bryan Kian Hsiang Co-Lecturer
LI XINYAN Teaching Assistant
Consultation :  please drop me an email / SMS first.  Every Friday 8-11am. COM1 Level2
LE MINH KHUE Teaching Assistant
RAHUL SINGHAL Teaching Assistant
Consultation : Consultation timings- Friday 12- 1 pm. AS6 , level 4, G3 lab. Please mail me in advance along with the topics which you want to discuss.
ZHANG JING Teaching Assistant
Consultation :
S17 Math Building Lounge at Level 4. Email in advance to arrange time and venue. Mondays 12-14 hrs.

WORAPOL RATANAPAN Teaching Assistant
Consultation : Every Wed 1-2pm @ Launchpad, N-House i.e. level 1, block 15, PGP (take A1 or A2, alight at the last stop)
Please note that I'll be abroad during the recess week.
LE XUAN BACH Teaching Assistant
HAN XIANGYU Teaching Assistant
Tags --

Learning Outcomes | Prerequisites | Preclusions | Workload

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 formulation 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 finite 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.

A-level Mathematics or H2 Mathematics or MA1301



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