Me
DS Assignment
Folder contents:
-
Details
Tutorial 1.1 SCSI_SECI1013 201920s1.pdf
Tutorial 1.1 SCSI_SECI1013 201920s1.pdf
-
Details
Tutorial 1.2 SCSI_SECI1013 201920s1.pdf
Tutorial 1.2 SCSI_SECI1013 201920s1.pdf
-
Details
Tutorial 2.1 SCSI_SECI1013 201920s1.pdf
Tutorial 2.1 SCSI_SECI1013 201920s1.pdf
-
Details
Tutorial 2.2 SCSI_SECI1013 201920s1.pdf
Tutorial 2.2 SCSI_SECI1013 201920s1.pdf
-
Details
Tutorial 3 SCSI_SECI_1013 201920.pdf
Tutorial 3 SCSI_SECI_1013 201920.pdf
-
Details
Tutorial 4 SCSI_SECI_1013 201920.pdf
Tutorial 4 SCSI_SECI_1013 201920.pdf
DS Slide
Folder contents:
-
Details
CH01P1 Set Theory - Set Theory.pdf
CH01P1 Set Theory - Set Theory.pdf
-
Details
CH01P2 Set Theory - Operation on Set.pdf
CH01P2 Set Theory - Operation on Set.pdf
-
Details
CH03P1 Counting Methods.pdf
CH03P1 Counting Methods.pdf
-
Details
CH03P2 Permutation and Combination.pdf
CH03P2 Permutation and Combination.pdf
-
Details
CH03P3 Pigeonhole Principle.pdf
CH03P3 Pigeonhole Principle.pdf
-
Details
CH04P1 GraphTheory.pdf
CH04P1 GraphTheory.pdf
-
Details
Chapter 4 - Part 2 - Tree.pdf
Chapter 4 - Part 2 - Tree.pdf
-
Details
Chapter 5 Finite Automata.pdf
Chapter 5 Finite Automata.pdf
Reflection
Various method on counting and problem solving technique and theory that I have learnt throughout this course. Dr. Suhaila really make the class interesting and not boring. She always remind her students to do exercises when step out of the lecture room.
Course Synopsis
Discrete Structure introduces students to the principles and applications of discrete structure in the field of computer science.
The topics that are covered in this course are set theory, proof techniques, relations, functions, recurrence relations, counting methods, graph theory, trees and finite automata.
At the end of the course, the students should be able to use set theory, relations and functions to solve computer science problems, analyze and solve problems using recurrence relations and counting methods, apply graph theory and trees in real world problems and use deterministic finite automata finite state machines to model electronic devices and problems.