DISCRETE STRUCTURE

by MOHAMAD HAZIQ ZIKRY BIN MOHAMMAD RAZAK

<--- back to main profile! 

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.

Trees!

Reflection

When I first heard about this subject, I was really excited as I love mathematics. This subject has taught me set theories, probabilities, graphs and trees which are very interesting for me. The problem sets are quite challenging which require very critical thinking to solve them. Dr Roselina has taught me well regarding this subject and is always available to ask for help.

Favourite channel for reference!

Dijkstra's Algorithm

Updated on 01 February 2021, 12:06 PM; 428 page visits from 5 December 2020 to 25 October 2025