SECI1013 - Discrete Structure

Course Information

This course was taught by Dr Nor Haizan binti Mohamed Radzi and introduces students to the principles and applications of discrete structure in the field of computer science.We learnt 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.

Course Outline

CHAPTER 1: SET THEORY & LOGIC
CHAPTER 2: RELATIONS & FUNCTIONS
CHAPTER 3: COUNTING METHODS & PROBABILITY
CHAPTER 4: GRAPH THEORY
CHAPTER 5: FINITE AUTOMATA

Coursework

Quiz

Summary

This quiz tests our ability and understanding of set theory

Reflection

Careless mistake of not taking note of range given. Must be wary of all details given.

Summary

This quiz is about relations and functions.

Reflection

Not understanding real-life application of relations. Must find more example prior to quiz.

Assignment

Summary

This assignment is based on chapter 1 of the course which are about set theory, logic and proof techniques

Reflection

Overall did fairly well but one mistake at the Question 2 about logic property law. Must familiarize with shape of sentences to translates it to logic form.

Summary

This assignment is based on relations and functions. There are 13 questions in total.

Reflection

This assignment goes a bit more detail on relations and functions than what we have learnt in class.

Reflection

Discrete structure built a foundation for me to understand basic algorithms and data structures that I will use in programming. It has also enhance my problem-solving skills as most of the problems discussed in this subject are based of real life. I wished that I had allocate my time more to do exercises and practices to understand this subject better as the subject is quite complex.