CS60051: Discrete Structures

CS60051
Course name	DISCRETE STRUCTURES
Offered by	Computer Science & Engineering
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
{{{grades}}}
Semester	{{{semester}}}

Syllabus

Syllabus mentioned in ERP

Propositional Logic, Proof Methods of Implications, Sets, Basic operations on sets, Functions, Relations, Binary relations: Equivalence Relations, Partial Orders and Posets. Mathematical Induction, Pigeonhole Principle, First Order Logic and Other Proof Methods. Cardinality of sets, Finite and Infinite Sets, Countable and Uncountable Sets, Cantors Theorem. Algebraic Structures: Semigroups, Monoids, Groups, Substructures and Morphisms, Rings, Fields and Vector Spaces; Lattices, Boolean Algebras, Morphisms of Boolean Algebras; Basic Counting Principles, Permutations, Combinations, Recurrence Relations and their solutions.