IT-302 RGPV B.Tech

Discrete Structure (DS)

Previous year papers and the official syllabus are free to read, no account needed.

Previous Year Papers

7 papers, latest Dec 2025

Free

Topics as the official RGPV syllabus lists them.

Unit 1 Set Theory, Relation, Function, Theorem Proving Techniques 4

Definition of sets, countable and uncountable sets, Venn diagrams, proofs of general identities on sets
Definition of relations, types of relation, composition of relations, pictorial representation, equivalence relation, partial ordering relation, job scheduling problem
Definition of functions, types of functions, one‑to‑one, into and onto functions, inverse function, composition of functions, recursively defined functions, pigeonhole principle
Theorem‑proving techniques: mathematical induction and proof by contradiction

Unit 1 notes

Unit 2 Algebraic Structures 2

Definition, properties and types: semigroups, monoid, groups, abelian groups, subgroup, cyclic groups, normal subgroup, homomorphism and isomorphism of groups; examples and standard results
Rings and fields: definition and standard results

Unit 2 notes

Unit 3 Propositional Logic 2

Proposition, first‑order logic, basic logical operations, truth tables, tautologies, contradictions, algebra of propositions, logical implications, logical equivalence, predicates, normal forms, universal and existential quantifiers
Introduction to finite‑state machines: FSMs as models of physical‑system equivalence machines and as language recognizers

Unit 3 notes

Unit 4 Graph Theory 4

Introduction and basic terminology of graphs, planar graphs, multigraphs and weighted graphs, isomorphic graphs
Paths, cycles and connectivity, shortest path in weighted graphs
Eulerian paths and circuits, Hamiltonian paths and circuits
Graph colouring, chromatic number, isomorphism and homomorphism of graphs

Unit 4 notes

Unit 5 Posets, Hasse Diagram and Lattices 3

Ordered sets, Hasse diagrams of partially ordered sets, isomorphic ordered sets, well‑ordered sets, properties of lattices, bounded and complemented lattices
Combinatorics: introduction, permutations and combinations, binomial theorem
Recurrence relations and generating functions: introduction to recurrence relations, linear recurrence relations with constant coefficients, homogeneous solutions, particular solutions, total solutions, generating functions, solving by the method of generating functions

Unit 5 notes

Counted from 8 past IT-302 papers.

Average marks of the questions from each unit in one paper. You answer only some of them, so the total is more than the paper’s maximum.

Define a planar graph and prove Euler's formula $v - e + r = 2$ for any connected planar graph.

Asked 4 times: 2025, 2024
Draw the Hasse diagram for a divisibility poset (e.g., a given finite set under divides, positive divisors of 36).

Asked 4 times: 2025, 2024, 2022, 2020
Prove that the set $\{0,1,\dots,n-1\}$ under addition modulo $n$ is an abelian group and identify identity and inverses.

Asked 3 times: 2025, 2024