SECI1013-03 (DISCRETE STRUCTURE)

A Brief Synopsis of the following Course:

Discrete Structure (SECI 1013) aims to introduce 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.

By 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.

Discrete Structure (DS) is a course where I learned about the principles and applications of discrete structure in the field of computer science. My ambition is to become a machine learning engineer, knowledge given to me by DS is a step towards my dreams.

I would like to express my gratitude towards Dr Nor Azizah Ali. Most of the assignments given were difficult to complete, things would have been more complicated without the help of Dr Nor Azizah.

My groupmates from group 7 also made assignments a whole lot easier, without their top-notch communication and cooperation I don’t think putting a close to this assignment would be easy.

To go back to my profile click here.