MATH-101
Discrete Structures
Credit Hours 3
Prerequisite: None
Sets. Sequences and functions, Elementary logic. Propositional calculus, Methods of proof, Mathematical induction, recurrence relation, loop invariants, Relations. Equivalence of Relations and partitions. Partially ordered sets. Properties of general Relations, Introduction to combinatorics. Basic counting techniques. Elementary Probability, Inclusion-Exclusion principle and binomial methods. Counting & partitions. Pigeon hole principle. Algebraic structures; groups and semi groups.


For University course page click Here :