SECI1013-01 STRUKTUR DISKRIT (DISCRETE STRUCTURE)

Importance-of-Mathematics-in-Computer-Science.png

This course 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.

 

Lecturer : DR NOR HAIZAN BINTI MOHAMED RADZI

Predicate Logic

Tensed-Predicate-Logic.png

Chap1 - Set Theory & Logic

Chap2 - Relations & Functions

Chap3 - Counting & Probability

Chap4 - Graph Theory

Chap5 - Finite Automata

Reflection

For me, the course Discrete Structure is like a giant mansion with all of the lights turned off. You wonder around it for a very long time, stumbling over furniture and getting lost. Eventually you find a light switch, and then everything changes.

Discrete Structure is a brand new thing for me as I never learned theories like finite automataduring my high school or pre-university studies. At first, it was hard for me to understand the concepts of certain topics but after I attended to few more classes and completed a few more exercises, I started to understand it and know how to apply those theories in the examinations. Discrete Structure is the fundamental of data science and as a data engineering's student, I clearly knew that I had to understand the concept of it. I am very lucky to have studied this Discrete Structure, many thanks to Dr Nor Haizan who is always patient when explaining the theories to us.