Discrete Mathematics (PCC-CS401) - Predicted Questions
for MAKAUT 2025
Disclaimer: These predictions are based on analyzing past trends and syllabus
content. While designed for high coverage, the actual exam paper may vary. Students
should study the entire syllabus thoroughly for the best preparation.
Predicted Examination Questions for 2025 (Unit-wise)
These questions cover the high-probability topics and various question types (VSQ,
Short, Long) as seen in past papers.
Unit 1: Sets, Relation, Function & Principles of Mathematical Induction
● Suggested Questions:
1. (Long Answer) State the Principle of Mathematical Induction. Prove by
mathematical induction that n!>2n for all integers n≥4. (Or a similar proof
involving summation like ∑i=1ni2=6n(n+1)(2n+1), or divisibility like 3∣(n3−n)).
2. (Short/Long Answer) State the Division Algorithm. Use the Euclidean
Algorithm to find the Greatest Common Divisor (GCD) of two numbers (e.g.,
272 and 119, or 567 and 315) and express it in the form ax+by.
3. (Long Answer) Define an Equivalence Relation. Show that the relation
a≡b(modm) is an equivalence relation on the set of integers Z. Partition the
set Z by the equivalence classes modulo 3.
4. (Short Answer) Define Countable and Uncountable sets. Prove that the set
of integers Z is countable.
5. (VSQ/Short Answer) Define Binary Relation, Reflexive Relation, Symmetric
Relation, Transitive Relation, Partial Order Relation, Equivalence Relation. Give
examples for each on a small set (e.g., {1,2,3}).
6. (VSQ/Short Answer) Define Injective, Surjective, and Bijective functions.
Give examples for functions on finite sets. What is the condition for a function
f:A→B to have an inverse?
7. (Short Answer) State and prove the Fundamental Theorem of Arithmetic.
8. (VSQ/Short Answer) Find the number of binary relations or equivalence
relations on a finite set of size n.
Unit 2: Basic Counting Techniques
● Suggested Questions:
1. (Short Answer) State the Pigeonhole Principle (both forms). Use it to prove
that in any group of 6 people, either there are 3 mutual friends or 3 mutual
strangers (Ramsey Number R(3,3) application).
2. (Long Answer) State the Principle of Inclusion-Exclusion for three sets. Use
it to find the number of integers between 1 and 1000 (inclusive) that are not
divisible by 2, 3, or 5.
3. (Short Answer) How many distinct permutations are there of the letters in
the word 'MISSISSIPPI'?
4. (Short Answer) From a group of 10 men and 8 women, how many ways can a
committee of 5 people be formed such that it includes exactly 3 men and 2
women?
5. (VSQ/Short Answer) Simple permutation (P(n,r)) and combination (C(n,r))
calculation problems.
Unit 3: Introduction to Propositional Calculus
● Suggested Questions:
1. (Long Answer) Without using a truth table, prove that (p→q)∧(q→r)→(p→r)
is a tautology using logical equivalences. (Or another tautology proof like
((p∨q)∧(p→r)∧(q→r))→r).
2. (Short Answer) Obtain the Conjunctive Normal Form (CNF) and Disjunctive
Normal Form (DNF) of the compound proposition (p∧¬q)→r.
3. (Long Answer) Check the validity of the following argument using rules of
inference: Premises: p→q, ¬q∨r, ¬r. Conclusion: ¬p.
4. (Short Answer) Symbolize the following statements using quantifiers: (i)
Some students are clever. (ii) All birds can fly. (iii) There is a student who likes
discrete mathematics and algorithms.
5. (VSQ) What is the contrapositive of p→q? What is the inverse of p→q? What
is the converse of p→q?
6. (VSQ) Define Tautology, Contradiction, and Contingency. Give an example of
each.
7. (Short Answer) Explain Proof by Contradiction and Proof by
Contraposition with simple examples.
Unit 4: Algebraic Structures and Morphism
● Suggested Questions:
1. (Long Answer) Define a Ring and an Integral Domain. Prove that every finite
integral domain is a field.
2. (Short Answer) Define a Group and state its axioms. Show that the set of
non-zero rational numbers Q∗ under multiplication is an abelian group.
3. (Short Answer) Define a Subring. Show that the set S={(a00b)∣a,b∈Z} is a
subring of the ring of 2×2 matrices with integer entries.
4. (Short Answer/Long Answer) Define Group Homomorphism and Kernel of a
homomorphism. If ϕ:G→H is a group homomorphism, prove that ker(ϕ) is a
normal subgroup of G.
5. (VSQ/Short Answer) Definitions of Semi-group, Monoid, Field, Ideal. Give
simple examples for each.
6. (Short Answer) In a ring R, prove that (−a)⋅b=−(a⋅b) for all a,b∈R.
Unit 5: Graphs and Trees
● Suggested Questions:
1. (Long Answer) Define Graph Isomorphism. Determine if the two given
graphs are isomorphic (provide diagrams of two potentially isomorphic or
non-isomorphic graphs). Justify your answer by comparing properties.
2. (Short Answer/Long Answer) Define Eulerian Path/Circuit and Hamiltonian
Path/Circuit. State the necessary and sufficient conditions for the existence
of an Eulerian circuit in a connected graph. Determine if a given graph has an
Eulerian circuit or path (provide a graph).
3. (Long Answer) Define Chromatic Number χ(G). Find the chromatic number
of the following graphs: Kn, Cn(for n even and n odd), Bipartite Graph, Wheel
Graph Wn.
4. (Short Answer) State and prove the Handshaking Lemma
(∑v∈Vdeg(v)=2∣E∣).
5. (Short Answer) Define a Tree. Prove that for any tree with n vertices, ∣V∣=n,
∣E∣=n−1.
6. (VSQ/Short Answer) Define Adjacency Matrix and Incidence Matrix.
Construct these matrices for a given small graph.
7. (VSQ/Short Answer) Define Planar Graph. State Euler's formula for planar
graphs (v−e+f=2).
8. (Short Answer) Define Bipartite Graph. Prove that a graph is bipartite if and
only if it contains no odd cycles.
Important Topics for 2025 (High Probability Areas)
Based on recurrence in past papers and fundamental importance:
● Unit 1:
○ Mathematical Induction Proofs (especially divisibility or summation
formulas).
○ Euclidean Algorithm for GCD and expressing GCD as a linear combination
(ax+by).
○ Proof of the infinitude of prime numbers.
○ Definition and properties of Equivalence Relations and Partitions.
○ Definitions of Countable and Uncountable sets.
● Unit 2:
○ Pigeonhole Principle (Statement and applications like handshake problem,
sock problem, birthday problem).
○ Inclusion-Exclusion Principle (Statement and application to counting
problems involving "not divisible by", surveys, etc.).
○ Permutation and Combination problems (counting arrangements and
selections with/without constraints).
● Unit 3:
○ Constructing Truth Tables.
○ Proving Logical Equivalence using Laws of Logic (without truth tables).
○ Converting expressions to CNF/DNF (with/without truth tables).
○ Checking the validity of arguments using Rules of Inference or truth tables.
○ Symbolization of English sentences into Predicate Logic using Quantifiers.
○ Understanding and applying proof techniques (especially Proof by
Contradiction and Contraposition).
● Unit 4:
○ Definitions and examples of Group, Ring, Integral Domain, Field.
○ Proof that a Finite Integral Domain is a Field.
○ Definition and properties of Subgroups and Subrings.
○ Definition and Kernel of Group/Ring Homomorphisms.
○ Properties of specific structures (e.g., x2=x implies commutativity in a ring).
● Unit 5:
○ Graph Definitions and Terminology (Degree, Path, Cycle, Isomorphism,
Planar, Bipartite).
○ Isomorphism Check (Visual inspection and property comparison).
○ Eulerian and Hamiltonian Walks/Circuits (Definitions and
conditions/algorithms).
○ Graph Colouring: Chromatic Number (definition, finding for simple graphs),
Chromatic Polynomial (definition, calculation for simple graphs,
Decomposition Theorem).
○ Trees: Definition, properties (n vertices, n−1 edges, connected, acyclic),
Spanning Trees (definition, finding).
○ Degree Sum Theorem.
…………The End……….
Mock Question Paper for 2025 (Sample)
Subject: Discrete Mathematics
Subject Code: PCC-CS401
Time Allotted: 3 Hours
Full Marks: 70
Instructions: Answer any ten questions from Group A, any three from Group B, and
any three from Group C. The figures in the margin indicate full marks.
Group-A (Very Short Answer Type Question)
Answer any ten of the following: [1 x 10 = 10]
(i) Define a reflexive relation.
(ii) Construct the truth table for (p⊕q)∨¬p.
(iii) Define a Monoid.
(iv) What is the maximum number of edges in a simple graph with n vertices?
(v) State De Morgan's Law for sets.
(vi) How many ways can you select a team of 3 students from a class of 20?
(vii) What is the negation of the statement "All cats are black"?
(viii) Define a Subgroup.
(ix) Define a Spanning Tree.
(x) What is the GCD of two prime numbers?
(xi) In a group of 25 students, if there are 10 students who like Math and 15 students who like
Physics, is it guaranteed that there's a student who likes both? Justify using set theory
concepts.
(xii) Give an example of a relation that is symmetric and transitive but not reflexive.
Group-B (Short Answer Type Question)
Answer any three of the following: [5 x 3 = 15]
2. Prove by mathematical induction that 5∣(n5−n) for all integers n≥1. [5]
3. A box contains 5 red, 7 blue, and 3 green balls. If you draw balls without
replacement, what is the minimum number of balls you must draw to be sure to
get at least two balls of the same color? Explain using the Pigeonhole Principle.
[5]
4. Show that the compound proposition (p∧(p→q))→q is a tautology using a truth
table. [5]
5. In a ring R, if x2=x for all x∈R, prove that R is commutative. [5]
6. Define a Bipartite Graph. Prove that a connected bipartite graph has a
chromatic number of 2. [5]
Group-C (Long Answer Type Question)
Answer any three of the following: [15 x 3 = 45]
7. (a) State the Division Algorithm. Use the Euclidean Algorithm to find gcd(414, 66)
and express it in the form 414x+66y. [8]
(b) Define Equivalence Relation and Partition. Given the set S={1,2,3,4,5} and the
relation R={(a,b)∣a−b is even}. Show that R is an equivalence relation and find the
partition of S induced by R. [7]
8. (a) Define Group Isomorphism. Determine whether the two graphs given below
are isomorphic. Justify your answer. [8]
(Provide diagrams of two simple graphs, e.g., a cycle graph C4and a path graph
P4, which are not isomorphic, or two isomorphic graphs like a square and a
diamond shape with diagonals).
(b) Define Chromatic Number. Find the chromatic number of the Petersen graph
(you can draw it or describe its structure). State Brooks' Theorem related to
chromatic number. [7]
9. (a) State the Principle of Inclusion-Exclusion for three finite sets. In a class of 50
students, 20 study Chemistry, 30 study Physics, and 15 study Math. 7 study
Chemistry and Physics, 8 study Physics and Math, 5 study Chemistry and Math,
and 3 study all three subjects. Find the number of students who study exactly one
subject. [8]
(b) Without using a truth table, obtain the Conjunctive Normal Form (CNF) of the
expression ¬(p∨q)→(p∧q) using logical equivalences. [7]
10.(a) Define a Ring and an Ideal of a ring. Show that the set of even integers 2Z is an
ideal of the ring of integers Z. [8]
(b) Define Group Homomorphism. Prove that if ϕ:G→H is a group homomorphism,
then ϕ(eG)=eH, where eGand eHare the identity elements of G and H
respectively, and ϕ(g−1)=(ϕ(g))−1 for all g∈G. [7]
11. (a) Check the validity of the following argument using rules of inference: [8]
Premises:
If it is raining, then the streets are wet.
The streets are wet.
Conclusion: It is raining.
(Identify this as a fallacy and explain why).
Then, check the validity of this argument using rules of inference:
Premises:
If it is raining, then the streets are wet.
It is raining.
Conclusion: The streets are wet.
(Identify this as Modus Ponens).
(b) Explain the difference between Permutation and Combination with an example for each. How
many ways can you arrange 4 men and 3 women in a row so that all women sit together? [7]
