Discrete Structure

Discrete Structure

discrete-mathematics-600x600.png

Subject Code : SECI 1013

Lecturer : Dr Noorfa Haszlinna Mustaffa 

       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.   

Reflection towards Discrete Structure

           Discrete Structure  is a mathematic course which is elemental for computer science students  Discrete Structure expose us to the  concept of set theory, proof techniques, relations, functions, recurrence relations, counting methods, graph theory, trees and finite automat which is required for us to  implement on daily life to solve real life problems and satisfy client's needs . I have noticed that my logical reasoning and critical thinking had improved over time as I take Discrete Structure which will totally benefit me in the future IT industry . I am also and happy to have Dr . Noorfa as my lecturer as every question I had in my mind were explained and illustrated in full passion .