SECI1013 - 03
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.
Course Content
CHAPTER 1 : Set Theory & Logic
CHAPTER 2 : Relations & Functions
CHAPTER 3 : Counting Methods & Probability
CHAPTER 4 : Graph Theory
CHAPTER 5 : Finite Automata
Need To Do
Reflection
RSS
By learning this subject, I have gained a lot of new knowledge that I find really useful for my future career and future studies as a data engineering student. I really enjoy learning this subject as Mathematics has always been one of my favourite subjects and most of the topics covered in this subject are the topics I like. My goal for this subject is to achieve a good result and get deeper understanding about the subject. To achieve that goal, I will try my best to explore more about this course and gain more knowledge so that I can become a more knowledgeable.
Assignments
-
Download Assignment 3.pdf
Assignment 3.pdf Details
- Sunday, 24 January 2021 [284.4KB] -
Download Assignment 4.pdf
Assignment 4.pdf Details
- Sunday, 24 January 2021 [880.2KB] -
Download Assignment 2.pdf
Assignment 2.pdf Details
- Sunday, 24 January 2021 [254.8KB] -
Download Assignment 1.pdf
Assignment 1.pdf Details
- Sunday, 24 January 2021 [429.4KB]