Discrete Structure SECI 1013-6
RSS
This subject teaches me another field of mathematics, which is Group and Set Theory. The subjects instruct me how the data was grouped mathematically. There are may theory and formula that used to solve the problem and we can apply it in our lives. As an example, we can use Euler Trail to connect all the point in the minimum distance between each point. This question is easy enough for me because I like mathematics. Even some of student felt study mathematics is hard, but if you have commited to practice, this hard will become easy easily.So keep practice and the easy will be come to you...
File(s) to download
-
Download CH01P4 Quantifier Proof Technique.pdf
CH01P4 Quantifier Proof Technique.pdf Details
- Thursday, 26 December 2019 [3.1MB] -
Download CH03P1 Counting Methods.pdf
CH03P1 Counting Methods.pdf Details
- Thursday, 26 December 2019 [210.7KB] -
Download CH03P2 Permutation and Combination.pdf.1
CH03P2 Permutation and Combination.pdf.1 Details
- Thursday, 26 December 2019 [951.6KB] -
Download CH04P1 GraphTheory.pdf
CH04P1 GraphTheory.pdf Details
- Thursday, 26 December 2019 [1.4MB] -
Download CH03P4 Probability.pdf
CH03P4 Probability.pdf Details
- Thursday, 26 December 2019 [8.1MB] -
Download CH03P3 Pigeonhole Principle.pdf
CH03P3 Pigeonhole Principle.pdf Details
- Thursday, 26 December 2019 [1.2MB] -
Download CH01P3 Fundamental of Logic.pdf
CH01P3 Fundamental of Logic.pdf Details
- Thursday, 26 December 2019 [880.4KB] -
Download CH01P2 Set Theory - Operation on Set.pdf
CH01P2 Set Theory - Operation on Set.pdf Details
- Thursday, 26 December 2019 [1.2MB] -
Download CH01P1 Set Theory - Set Theory.pdf
CH01P1 Set Theory - Set Theory.pdf Details
- Thursday, 26 December 2019 [1.8MB]