Centralised Online Undergraduates Registration System (CORS)

      


Module Detailed Information for [CS1231]
Academic Year : 2017/2018 Semester : 2
Correct as at 30 Mar 2018 04:27

Back to Module Information Listing
Module Information
Module Code :
CS1231 IVLE
Module Title : Discrete Structures
Module Description : 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.
Module Examinable : -
Exam Date : 10-05-2018 AM
Modular Credits : 4
Pre-requisite : A-level Mathematics or H2 Mathematics or MA1301 or MA1301FC or MA1301X
Preclusion : MA1100
Module Workload (A-B-C-D-E)* : 3-1-0-3-3
Remarks : Nil
* A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of laboratory 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


Lecture Time Table
Class TypeWeek TypeWeek DayStartEndRoom
1 SECTIONAL TEACHINGEVERY WEEKMONDAY10001100i3-Aud,
1 SECTIONAL TEACHINGEVERY WEEKWEDNESDAY9001100i3-Aud,

Tutorial Time Table
Attention: The tutorial timetables could be updated from time to time. Students are advised to check regularly for the latest update on the change of tutorial timing.
Class TypeWeek TypeWeek DayStartEndRoom Iteration
1 TUTORIALEVERY WEEKTUESDAY9001000COM1-0217,
Available in Tutorial Balloting [Iteration 2].
10 TUTORIALEVERY WEEKFRIDAY11001200COM1-0217,
Available in Tutorial Balloting [Iteration 2].
11 TUTORIALEVERY WEEKFRIDAY14001500COM1-0217,
Available in Tutorial Balloting [Iteration 2].
12 TUTORIALEVERY WEEKFRIDAY15001600COM1-0217,
Available in Tutorial Balloting [Iteration 2].
13 TUTORIALEVERY WEEKTUESDAY12001300AS6-0208,
Available in Tutorial Balloting [Iteration 2].
14 TUTORIALEVERY WEEKTUESDAY16001700AS6-0208,
Available in Tutorial Balloting [Iteration 2].
15 TUTORIALEVERY WEEKTUESDAY17001800AS6-0208,
Available in Tutorial Balloting [Iteration 2].
16 TUTORIALEVERY WEEKFRIDAY16001700AS6-0208,
Available in Tutorial Balloting [Iteration 2].
17 TUTORIALEVERY WEEKFRIDAY17001800AS6-0208,
Available in Tutorial Balloting [Iteration 2].
2 TUTORIALEVERY WEEKTUESDAY10001100COM1-0217,
Available in Tutorial Balloting [Iteration 2].
3 TUTORIALEVERY WEEKTUESDAY11001200COM1-0217,
Available in Tutorial Balloting [Iteration 2].
4 TUTORIALEVERY WEEKTHURSDAY14001500AS6-0208,
Available in Tutorial Balloting [Iteration 2].
5 TUTORIALEVERY WEEKTHURSDAY15001600AS6-0208,
Available in Tutorial Balloting [Iteration 2].
6 TUTORIALEVERY WEEKTHURSDAY16001700COM1-0218,
Available in Tutorial Balloting [Iteration 2].
7 TUTORIALEVERY WEEKTHURSDAY17001800COM1-0218,
Available in Tutorial Balloting [Iteration 2].
8 TUTORIALEVERY WEEKFRIDAY9001000COM1-0217,
Available in Tutorial Balloting [Iteration 2].
9 TUTORIALEVERY WEEKFRIDAY10001100COM1-0217,
Available in Tutorial Balloting [Iteration 2].





  NUS Help NUS Home Search Site Map Contact NUS Legal