UNIT: 1 Mathematical Logic:
Proposition & Propositional Form conditional and Bi-conditional Statements, Negation operation, Logic connectives and compound statements, conjunction, disjunction, truth tables, Duality conditional and in-conditional statements.
UNIT: 2 Boolean Algebra :
Development of Boolean Algebra, Truth functions, The AND, OR, NOT operators, Laws of Boolean Algebras, Reducing Boolean Expressions, Boolean expressions and logic diagrams Universal Building blocks, Negative Logic Min terms, Truth tables and K-maps, Reduction of K maps Disjunctive normal form.
UNIT: 3 Graph theory:
Definition of a graph, finite and infinite graphs, Incidence and degree, null graph, Subgraphs walks, Paths and circuits in a graph, connected graphs, Trees, Properties of Trees, Planner graphs. Incidence Matrix.
UNIT: 4 Function and Relation :
Injective and surjective functions, composition of function, Inverse function, Use of function in coding theory, Relation composition of relation, Equivalence relation.
SUGGESTED READINGS:-
- 1. C.L. Liu, "Elements of Discrete Mathematics" Mc Graw Hill Book Co., 1985
- 2. N. Deop, "Graph Theory with applications to Engineering and Computer Science", PHI 1993.
- 3. B. Colman and Robert C. Busby, "Discrete Mathematical structure for Computer Science," PHI.
- 4. Olympia Nicodemi, "Discrete Mathematics" CBS Publication, Delhi.
- 5. M.N.S. Swamy and K. Thulasiraman, "Graphs, Networks and Algorithms," Wiley Inter Science, NY, 1989