This course aims at providing students with a solid foundation of basic techniques in discrete mathematics. The topics include elementary set theory, functions, elementary number theory and methods of proof, recursion, counting principle, and graph theory.

CILO-1: Use direct and indirect proof of mathematical statement. CILO-2: Identify, formulate and solve problems in field of sequences and recursively defined sequences. CILO-3: Demonstrate basic properties of functions defined on a general domain. CILO-4: Utilize counting principles and interpret the reason behind. CILO-5: Construct the Euler circuit, Hamiltonian circuit, and shortest path of a graph.