Discrete Mathematics Syllabus
1. Set Theory
- Sets, Countable and Uncountable Sets, Venn Diagrams
- Proofs of general identities on sets
2. Relations
- Definition and types of relation
- Composition of relations
- Pictorial representation of relation
- Equivalence relation
- Partial ordering relation
- Job-Scheduling problem
3. Functions
- Definition and types of functions
- One-to-one, Into, Onto functions
- Inverse function
- Composition of functions
- Recursively defined functions
- Pigeonhole principle
4. Theorem Proving Techniques
- Mathematical induction
- Proof by contradiction
5. Algebraic Structures
- Definition and properties
- Types: Semigroups, Monoids, Groups, Abelian Groups
- Properties of Groups, Subgroups, Cyclic Groups, Cosets, Factor Groups
- Permutation Groups, Normal Subgroups
- Homomorphism and Isomorphism of Groups
- Rings and Fields: Definitions and standard results
6. Propositional Logic
- Proposition, First-order logic
- Basic logical operations, truth tables
- Tautologies, Contradictions
- Algebra of propositions, logical implications and equivalence
- Predicates, Normal Forms
- Universal and existential quantifiers
7. Finite State Machines
- Introduction to finite state machines
- FSMs as models of physical systems
- Equivalence machines
- FSMs as language recognizers
8. Graph Theory
- Introduction and basic terminology of graphs
- Planar graphs, Multigraphs, Weighted graphs
- Isomorphic graphs
- Paths, Cycles and Connectivity
- Shortest path in weighted graph
- Eulerian and Hamiltonian paths and circuits
- Graph coloring, Chromatic number
- Isomorphism and Homomorphism of graphs
9. Posets, Hasse Diagram and Lattices
- Introduction to partially ordered sets
- Hasse diagram of partially ordered sets
- Isomorphic ordered sets, Well ordered sets
- Properties of lattices, bounded and complemented lattices
10. Combinatorics
- Introduction, Permutations and Combinations
- Binomial Theorem, Multinomial Coefficients
11. Recurrence Relations and Generating Functions
- Introduction to recurrence relations and recursive algorithms
- Linear recurrence relations with constant coefficients
- Homogeneous and Particular solutions
- Total solutions
- Generating functions
- Solution by method of generating functions