CS-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
- CS-302 paper, Dec 2025
- CS-302 paper, Jun 2025
- CS-302 paper, Dec 2024
- CS-302 paper, Jun 2024
- CS-302 paper, Dec 2023
- CS-302 paper, Jun 2023
Syllabus, notes and important questions for CS-302
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Set Theory, Relations, Functions, and Theorem Proving Techniques 7 topics
- Definition of sets, countable and uncountable sets
- Venn diagrams and proofs of general set identities
- Definition and types of relations, composition of relations, pictorial representation
- Equivalence relations and partial ordering relations; Job‑scheduling problem
- Definition and types of functions, one‑to‑one, onto, into, inverse functions, composition of functions
- Recursively defined functions and the pigeonhole principle
- Mathematical induction and proof by contradiction
Unit 2 Algebraic Structures 4 topics
- Definition and properties of semigroups and monoids
- Groups, Abelian groups, subgroup, cyclic groups, cosets, factor groups
- Permutation groups, normal subgroups, homomorphism and isomorphism of groups
- Rings and fields: definitions and standard results
Unit 3 Propositional and First‑Order Logic 4 topics
- Propositions, predicates, and quantifiers (universal and existential)
- Basic logical operations, truth tables, tautologies and contradictions
- Algebra of propositions, logical implications and equivalence
- Normal forms (CNF, DNF) and logical equivalences
Unit 4 Finite State Machines 3 topics
- Finite state machines as models of physical systems
- Equivalence of finite state machines
- Finite state machines as language recognizers
Unit 5 Graph Theory 6 topics
- Basic terminology of graphs, planar graphs, multigraphs and weighted graphs
- Isomorphic graphs, paths, cycles and connectivity
- Shortest path algorithms in weighted graphs
- Eulerian paths and circuits, Hamiltonian paths and circuits
- Graph coloring, chromatic number
- Isomorphism and homomorphism of graphs
Unit 6 Posets, Hasse Diagrams and Lattices 3 topics
- Ordered sets and Hasse diagrams
- Isomorphic and well‑ordered sets
- Properties of lattices, bounded and complemented lattices
Unit 7 Combinatorics 2 topics
- Permutations and combinations
- Binomial theorem and multinomial coefficients
Unit 8 Recurrence Relations and Generating Functions 4 topics
- Introduction to recurrence relations and recursive algorithms
- Linear recurrence relations with constant coefficients: homogeneous and particular solutions
- Total solutions of recurrence relations
- Generating functions and solution by the method of generating functions
Exam insights
Counted from 8 past CS-302 papers.
Marks asked per paper, by unit
-
Unit 1 Set Theory, Relation, Function, Theorem Proving Techniques 28 marks
-
Unit 2 Algebraic Structures 20 marks
-
Unit 3 Propositional Logic 21 marks
-
Unit 4 Graph Theory 20 marks
-
Unit 5 Posets, Hasse Diagram and Lattices 21 marks
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.
Asked again and again
-
Find the identity element of the group $\mathbb{Z}$ with operation $a * b = a+b-2$.
Asked 3 times: 2024
-
Show that every Cyclic group is Abelian. Prove that a lattice with 5 elements is not a Boolean algebra.
Asked 3 times: 2024
-
Define the pigeonhole principle and write the contrapositive of the implication "if it is Sunday then it is a holiday".
Asked 3 times: 2024