CS1231
DISCRETE STRUCTURES (2010/2011, Semester 1) 

 MODULE OUTLINE Created: 02-Jul-2010, Updated: 09-Dec-2010
 
Module Code CS1231
Module Title DISCRETE STRUCTURES
Semester Semester 1, 2010/2011
Modular Credits 4
Faculty School of Computing
Department Computer Science
Timetable Timetable/Teaching Staff
Module Facilitators
ASSOC PROF Bressan, Stephane Lecturer
DR Low Bryan Kian Hsiang Co-Lecturer
MR Ehsan Rehman Teaching Assistant
CHAK HANRUI CHRISTOPHER Teaching Assistant
VEILLARD ANTOINE PAUL MITSUMASA Teaching Assistant
XIONG XI Teaching Assistant
LI ZHUORU Teaching Assistant
YE NAN Teaching Assistant
BI RAN Teaching Assistant
SHI XIAOJIE Teaching Assistant
Weblinks
Tags --


Learning Outcomes | Preclusions | Workload


 LEARNING OUTCOMES 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 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.


 PRECLUSIONS Top
MA1100


 WORKLOAD Top
3-1-0-3-3