CS1231
DISCRETE STRUCTURES (2009/2010, Semester 1) 

 MODULE OUTLINE Created: 03-Jul-2009, Updated: 28-Jul-2009
 
Module Code CS1231
Module Title DISCRETE STRUCTURES
Semester Semester 1, 2009/2010
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 Wednesday in COM1-03-44 from 10am to 12pm.

DR Low Bryan Kian Hsiang Co-Lecturer
Consultation : Walk-in consultation every Wed 10am-12noon TA Office COM1-02-46 (Call 65164719 to get me).
DANIEL HERMANN RICHARD DAHLMEIER Teaching Assistant
Consultation : Walk-in consultation hours on Thursday 12PM-1PM at Comp Linguistics Lab AS6 #04-13 or just send me an email. If you have problems opening the corridor door, you can call the lab phone: 65161371
ZHANG HAOJUN Teaching Assistant
Consultation : Wed 10-11, Fri 10-11 at DR4. Details are on my website. Emails are always welcome.
LU HAN Teaching Assistant
Consultation : Walk-in consultation every Friday from 11am to 12pm, in AS6/0502 Computer Vision Lab or by email.
SUCHEENDRA KUMAR PALANIAPPAN Teaching Assistant
Consultation : Walk-in consultation every Friday from 2 PM to 3 PM, at the Computational Biology lab (opposite graduate pantry, Level 1 COM1) or by email.
Weblinks
Tags --


Learning Outcomes | Prerequisites | Preclusions | Workload | References


 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.


 PREREQUISITES Top
A-level Mathematics or H2 Mathematics or MA1301


 PRECLUSIONS Top
MA1100


 WORKLOAD Top
3-1-0-3-3


 
 1. TEXT & READINGS Top
Total 3 items
Title and AuthorEdition / Year /
*ISBN
Publisher
Discrete Mathematics DeMYSTiFied
Author:Steven Krantz
1e / -
ISBN:007154948X
McGraw-HillReferences
Discrete Mathematics with Applications
Author:Susanna S. Epp
3e / -
ISBN:0534359450
Brooks ColeSupplementary
Discrete Mathematics and its Applications
Author:Kenneth H. Rosen
4 / -
ISBN:0072899050
McGraw-HillSupplementary



Learning Outcomes | Prerequisites | Preclusions | Workload | References