AI-Powered Learning Platform

Subject Syllabus

(CSIT)-302 – Discrete Structure

CSIT · Semester 3

Course Modules

Learn topic-wise with Hyper AI and revise using mapped PYQs.

Set Theory: Definition of sets Countable and uncountable sets Venn Diagrams Proofs of some general identities on sets Relation: Definition Types of relation Composition of relations Pictorial representation of relation Equivalence relation Partial ordering relation Job-Scheduling problem Function: Definition Type of functions: one to one, into and onto function Inverse function Composition of functions Recursively defined functions Pigeonhole principle Mathematical induction Proof by contradiction

Algebraic Structures: Definition Properties of Algebraic Structures Types: Semi Groups, Monoid Groups, Abelian group Properties of groups Subgroup Cyclic groups Cosets Factor group Permutation groups Normal subgroup Homomorphism and Isomorphism of Groups Homomorphism and Isomorphism: example and standard results Rings: Definition Rings: standard results Fields: Definition Fields: standard results

Propositional Logic: Proposition First order logic Basic logical operation Truth tables Tautologies Contradictions Algebra of Proposition Logical implications Logical equivalence Predicates Normal Forms Universal and existential quantifiers Finite State Machine: Introduction Finite state machines as models of physical system equivalence machines Finite state machines as language recognizers

Basic terminology of graphs Planar graphs Multigraphs Weighted graphs Isomorphic graphs Paths, Cycles and connectivity Shortest path in weighted graph Introduction to Eulerian paths and circuits Hamiltonian paths and circuits Graph coloring Chromatic number Isomorphism and Homomorphism of graphs

Posets: Introduction Ordered set Hasse diagram of partially ordered set Isomorphic ordered set Well ordered set Properties of Lattices Bounded and complemented lattices Combinatorics: Introduction Permutation and combination Binomial Theorem Multinomial Coefficients Introduction to Recurrence Relation Recursive algorithms Linear recurrence relations with constant coefficients Homogeneous solutions Particular solutions Total solutions Generating functions Solution by method of generating functions