SECI1013-03 (Discrete Structure)

by QAISARA BINTI ROHZAN

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.

ds1.jpg.1    ds.jpg

THE SYLLABUS

  • Chapter 1: Set Theory and Logic
  • Chapter 2: Relations and Functions
  • Chapter 3: Counting and Probability
  • Chapter 4: Graph Theory
  • Chapter 5: Finite Automata

GROUPMATES

Group 4 team members:

  1. Nurfarrahin binti Che Alias
  2. Goo Ye Jui
  3. Ong Han Wah
  4. Qaisara binti Rohzan

YOUTUBE REFERENCE

Download permuataion.mp4 [13.46MB]
Details

REFLECTION

For Discrete Structure, I can say that it is one of my favourite course in Year 1 Semester 1. This is because the topics learnt in this course is similar to normal mathematics but the only difference is that discrete structure or known as discrete mathematics is used widely in computation works. Having Dr. Nor Azizah as my lecturer is truly a blessing, not only she is soft spoken but she is also patient in explaining the concept or theory of the syllabus. I hope to make use of her teachings in my degree years and also score in the final examination.

ASSIGNMENT 1

ASSIGNMENT 2

ASSIGNMENT 3

ASSIGNMENT 4

ASSIGNMENT 5

Updated on 05 February 2021, 6:14 PM; 857 page visits from 4 February 2021 to 6 October 2025