Introduction
SECI1013 Discrete Structure is a course introduced students to the principles and applications of theories of discrete structure such as set theory, proof techniques, relations, functions, recurrence relations, counting methods, graph theory, trees and finite automata in computer science.
There is a total of 5 chapters in the SECI1013 Discrete Structure. The 5 chapters are “Set Theory & Logic”, “Relations & Functions”, “Counting Methods & Probability”, “Graph Theory” and “Finite Automata”.
TimeLine
List of Tutorials
Tutorial 3 – Chapter 1 – Chapter 3 (Set Theory & Logic, Relations & Functions, Counting Methods & Probability)
Reflection
I had learnt the theories of discrete structure and understand their usage in the field of computer science. These theories will be helpful when I try to solve problems related to computer science. For example, the theory of finite automata can be used in designing a machine that follows designated functions when the conditions are met. Besides, I can use the theories of set theory, relations, and functions to identify computer science problems and solve them. Apart from that, recurrence relations and counting methods can also be used in solving problems. Trees and graph theory are useful when facing real-world problems such as organising data and finding the shortest path. These theories will be useful when I need to solve real-world problems and complete tasks in the future.