3: Discrete Mathematics Course Structure: Lectures: 3 /
Labs: 0 Credit Hours: 3 Prerequisites: None Objectives: This course aims to develop understanding and appreciation
of the finite nature inherent problems and structures through study of
combinatorial reasoning, abstract algebra, iterative procedures, predicate
calculus, tree and graph structures.
Course Outline: Sets, Combinatorics, Sequences, Formal logic,
Prepositional and predicate calculus, Methods of Proof, Mathematical
Induction and Recursion, loop invariants, Relations and functions, Pigeon
whole principle, Trees and Graphs, Optimization and matching.
