MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE

UNIT 1
Relation and function: binary relation, properties of binary relations in a set, Equivalence
relation. Composition of binary relations, partial ordering and partial ordered set and hasse
diagram, functions and pigeonhole principle, principal of mathematical induction, recursive
definition, introduction to primitive function. Recursion and recurrence relation:
polynomials and their recursion, iteration, sequence and discrete functions, recurrence
relations, generating function.
UNIT 2
Mathematical logic: statement and notations, connectives (negation, conjunction,
disjunction, statement formulas and truth table, conditional and bi-conditional statements,
Tautologies, equivalence of formulas, tautological implications, validity using truth table
UNIT 3
Boolean algebra: lattices and algebraic systems, principle of duality, basic properties of
algebraic system, distributed and complemented lattices, Boolean lattices and Boolean
algebras, uniqueness of finite Boolean algebra, Boolean functions and Boolean expression,
Normal forms of Boolean expression and simplification of Boolean expression