SECI1013 Discrete Structure

     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's name: Dr Suhaila Mohamad Yusuf

at first, i didn't know it was a Mathematics subject based on the name Discrete Structure. but after the first class, i know it is when it involved the calculation and thinking. some of the topics were continous and more details than the ones i learned in matriculation.  and somehow, there are certain parts are even related with programming technique 1 that we learned. with Dr Suhaila's high passion in teaching, i was able to focus in class well and have interest in the topics.