1. CSNB143 – Discrete Structure

2. Learning Outcomes – At the end of this course, students should be able to use all basic concepts of mathematical structures to solve problems in information system. Please refer to the learning outcomes for the each topic covered

3. Credit and assessment 6 hours per week – please refer to the time table Assessment WhenWhatHow much? Week 3 (final session)Quiz 15% Week 4 (Friday)Test35% Week 6 (final session)Quiz 25% Week 7 (final session)Quiz 35% Week 8 (Exam Week)Final Exam50%

4. Teaching Plan WhenTopics to be covered Week 1 – 2Part 1 : Basic Knowledge / Digging the old knowledge Set: terms used, its operations, Venn Diagram. Sequence and String: its characteristics, concatenation, subsequence. Matrix: Operations on matrix, Boolean matrix. Logic: compound statement, Truth Table, logically equivalent, Quantifier Week 3 – 4Part 2: Intermediate / Using basic knowledge to explore new topics or enhance topics already known. Induction: types of induction, example for each type. Counting techniques: Permutation, Combination & Pigeon Hole. Part 2: Intermediate / Using basic knowledge to explore new topics or enhance topics already known. Relation: Definition, set, matrix and digraph representation, relation’s properties, equal relation, relation’s manipulation, closure, Poset, Hasse diagram, topological sorting. Assessment Week 3 : Quiz 1 – Covering week 1 & 2 Week 4 : Test - Covering Set, Sequence and String, Matrix, Induction & Counting Technique

5. Teaching Plan WhenTopics to be covered Week 5 - 6Part 3: Reuse / Using previous chapters and implement it to solve problems. Function: characteristics, cyclic function, permutation function Graph: characteristics, path and cycle, Euler and Hamilton Tree: Characteristics, labelled tree, minimal spanning tree, Prim and Kruskal Assessment Week 6 – Quiz 2 – On Relation and Function Week 7Part 3: Reuse / Using previous chapters and implement it to solve problems. Language: grammar, language representation Revision Week 7 – Quiz 3 – On Graph and Tree

6. References Primary – Kolman B., Busby R.C. and Ross S.: Discrete Mathematical Structures, 5 th Edition, Prentice Hall, 2005. Secondary – Kenneth H. Rosen: Discrete Mathematics and Its Application, 5 th Edition, McGraw-Hill, 2005. – Johnsonbaugh R.: Discrete Mathematics, 5 th Edition, Prentice Hall, 2001. – H. F. Mattson, Jr.: Discrete Mathematics with applications, John Wiley, 2004

7. Tips Do all tutorial / homework given Redo all problems discussed Rewrite your class note with important point and added point Discuss with friends in small group Ready for all test / quiz Always ready for next class’s lesson