DISCRETE MATHEMATICAL STRUCTURES BCS405A

Basic Connectives and Truth Tables, Logic Equivalence – The Laws of Logic, Logical Implication – Rules of Inference. The Use of Quantifiers, Quantifiers, Definitions and the Proofs of Theorems.

(RBT Levels: L1, L2 and L3)

Mathematical Induction, The Well Ordering Principle – Mathematical Induction, Recursive Definitions.

Fundamental Principles of Counting: The Rules of Sum and Product, Permutations, Combinations – The Binomial Theorem, Combinations with Repetition.

(RBT Levels: L1, L2 and L3)

Cartesian Products and Relations, Functions – Plain and One-to-One, Onto Functions. The Pigeonhole Principle, Function Composition and Inverse Functions.

Properties of Relations, Computer Recognition – Zero-One Matrices and Directed Graphs, Partial Orders – Hasse Diagrams, Equivalence Relations and Partitions.

(RBT Levels: L1, L2 and L3)

The Principle of Inclusion and Exclusion, Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook Polynomials.

Recurrence Relations: First Order Linear Recurrence Relation, The Second Order Linear Homogeneous Recurrence Relation with Constant Coefficients.

(RBT Levels: L1, L2 and L3)

Definitions and Examples of Particular Groups Klein 4-group, Additive group of Integers modulo n, Multiplicative group of Integers modulo-p and permutation groups, Properties of groups, Subgroups, cyclic groups, Cosets, Lagrange’s Theorem.

(RBT Levels: L1, L2 and L3)