DISCRETE MATHEMATICS (4 Credits)
Learning Outcomes:
On successful of this Course, students will be able to: LO1 – evaluate the logic of compound, quantified statements and method of proof related to discrete problems; LO2 – explain set theory, Fuzzy set, counting method, number theory and its applications; LO3 – analyze the relations and partial order set; LO4 – explain basic concepts of graph theory, tree and its application; LO5 – explain finite state automata and its application in computer science.
Topics:
- Logic
- Quantifiers
- Method of Proof
- Set Theory and Function
- Number Theory
- Counting
- Relation
- Graph
- Tree
- Finite State Automata
SOCIAL MEDIA
Let’s relentlessly connected and get caught up each other.
Looking for tweets ...