K. K.

Wagh Institute of Engineering Education and Research, Nashik

Department of Information Technology
Discrete Mathematics
S.Y B Tech 2024 25(Semester-I)
EndSem Question Bank
Q1. Define transitive closure. Let R= {(b,a) (c,b) (a,d) (b,d) (c,d) } on the set A= {a,b,c,d}.
Use Warshall’s algorithm to find transitive closure of R.
Q.2 Define the following terns with suitable example
i) Complete Graph (ii) Regular Graph (iii) Null graph (iv) Infinite Graph (v) Simple graph
Q3. State the principle of Mathematical Induction proves the following proposition:
P(n)=1+4+7+……. +(3n-2) = .
Q.4 Explain types of depth first traversal and breadth first traversal with suitable example.
Q.5 What is MST? Find the minimal spanning tree of weighted graph using
Kruskal's algorithm.

Q.6 Show that by mathematical Induction

Q.7 What is complement of Kn and Kmn ?

Q.8 Find pre-fix and post-fix expression for ((X + Y) / 2) + ((X - Y) / 3).\
Q.9 For instance, consider the following graph G and identify the minimum spanning tree
using Prim’s algorithm.
Q.10 In a university, there are 100 students. 30 students are enrolled in Mathematics, 40 in
Physics, and 50 in Chemistry. 10 students are enrolled in both Mathematics and Physics, 15
in both Physics and Chemistry, and 5 in both Mathematics and Chemistry. If 2 students are
enrolled in all three subjects, how many students are enrolled in exactly one subject?
Q.11 A graph contains 21 edges, 3 vertices of degree 4 and all other vertices of degree 2.
Find total number of vertices.
Q.12 What is complete Binary Tree? Show the binary search tree after inserting 13, 3, 4,
12, 14, 10, 5, 1, 8, 2, 7, 9, 11, 6, 18 into an initially empty binary search tree.
Q13. Find gcd(630, 96) and write in the form 630 x+ 96 y.
Q.14 In a group (G, *) , Prove that the inverse of any element is unique.
Q. 15 For the following set of weights, construct an optimal binary prefix code for each
weight
in the set, give the corresponding code word: 8, 9, 10, 11, 13, 15, 22
Q. 16. Which of the following is / are Hamiltonian graphs?

Q.17 Construct the minimum spanning tree (MST) for the given graph using Prim’s
Algorithm
 Q.18 Search the following Tree in pre-order, post-order, and in-order

Q19. Define the terms

1) Algebraic system 2) Semi-Group 3) Subgroup 4)Ring 5)Semigroup
Q. 20. Construct the binary search tree after inserting 50, 30, 70, 20, 40, 60, 80, 10, 25, 35,
45, 55, 65, 75, 85 into an initially empty binary search tree.
Q.21 Draw the graph and equivalent Hasse diagram for divisibility on the set: {1, 2, 3, 6, 12,
24, 36, 48}
Q.22 Construct the minimum spanning tree (MST) for the given graph using Kruskal’s
Algorithm.

Q.23What is an equivalent relation? Identity whether the given relation is an equivalent

where A= {1, 2, 3, 4}, relation R= {(1,1) (1,2) (2,1) (2,2) (3,1) (3,3) (1,3) (4,1) (4,4)}. Also
find equivalent classes.

Q.24 How many spanning trees the graph has? Draw all spanning trees of graph
 Q25. Find the shortest path using Dijkstra’s Algorithm for the given graph

Q.26 Write down Rules for Inorder, Preorder and postorder.

Construct a binary tree from given inorder and preorder traversals:
Inorder: AEBDCFGKIHJL
Preorder: FEADBCGHIKJL
Q27. Define the following terms with reference to the tree: Tree Traversal. [5M]
i. Depth-First Traversal
ii. Types of Depth-First Traversal
iii. Breadth-First Traversal
Q28. Explain the following types of Relation with suitable example
(i) Antisymmetric Relation
(ii) Transitive Relation
(iii) Symmetric Relation
(iv) Reflexive Relation
Q.29 Define the following term
i) Reflexive Closure
ii) Transitive Closure
iii) Symmetric closure
Q.30 Draw the graph and equivalent Hasse diagram for divisibility on the set:
{1, 2, 3, 6, 12, 24, 36, 48}

Q.31 Find the minimal spanning tree for the following weighted connected graph using
Prim's Algorithm
Q.32 Find gcd (102,30) and write in the form 102x+30y for x, y, ∈ Z
Q.33 Prove that Euler's theorem hold true for a = 2 and n = 10.
Q.34 Solve the recurrence relation Fn=5Fn−1−6Fn− where F0=1 and F1=4.
Q35. Determine the preorder, postorder and inorder traversal of the following binary tree

Q36. Suppose data items A, B, C, D, E, F, G occur in the following frequencies

Data items A B C D E F G
Weight 10 30 5 15 20 15 05
Construct a Huffman code for the data. What is the minimum weighted path length?
Q37. For the following set of weights, construct optimal binary prefix code. For each
weight in the set, give corresponding prefix code: 1,4,8,9,15,25,31,37.
Q.38 Define Fermat's theorem. Prove Fermat's theorem hold true for p = 13 and a = 11.
Q.39 Let A={1,2,3,4,5} and R be the relation on A such that R={(1,1), (1,4),(2,2),
(3,4),(3,5),(4,1),(5,2),(5,5). Find the transitive closure of R using Warshall’s Algorithm.
Q.40 Construct a Huffman code for the data. What is the minimum weighted path length?

:
Q41 Find the GCD (52,10) using Euclid’s Algorithm
Q42 Give the stepwise construction of minimum spanning tree using Prim’s algorithm for the
following graph. Obtain the total cost of minimum spanning tree.
Q.43 Identify whether the given relation is an equivalent relation where A={1,2,3,4}, relation
R={(1, 1),(1, 2),(2, 1), (2, 2), (3,1),(3, 3),(1, 3),(4, 1), (4, 4)} Also find the equivalent classes.
Q.44 Determine the minimum spanning tree using Kruskal’s algorithm for the following
graph:

Q45. a) Let, A={1,2,3,4,5,6,7,8,9,12,18,24} be ordered by the relation X divides Y (Y

divided by X) Show that the relation is a partial ordered and draw Hasse diagram.
Q46. Show that the set of all divisors of 70 for divisibility relation forms a lattice.
Q47 Let A={a, b, c, d} and let R be a relation on A whose relation is R={(b, a), (c, b), (a, d),
(b, d), (c, d) } . Find transitive closure using Warshalls method.
Q48 Explain the following types of function with suitable example
(i) Injective Functions
(ii) Surjective Functions
(iii) Bijective Functions
Q49. Let Relation R={(a,a)(a,b),(b,c)(c,c)} on A={a, b, c}.Find:
i. Reflexive closure
ii. Symmetric closure
iii. Transitive closure of R
Q50 Let R= {(1,4) (2,1) (2,5) (2,4) (4,3) (5,3) (3,2)} on the set A= {1,2,3,4,5}. Use
Warshall’s algorithm to find transitive closure of R.
Q51 Solve the following equations using Chinese Remainder Theorem
x = 7 (mod 12345), x= 3 (mod 11111).
Q52 What is an equivalent relation? Identity whether the given relation is an equivalent
where A= {1, 2, 3, 4}, relation R= {(1,1) (1,2) (2,1) (2,2) (3,1) (3,3) (1,3) (4,1) (4,4)}. Also
find equivalent classes.
Q53. If A= {1, 2, 3, 4}, define relations on A which have properties
 i. Reflexive, transitive but not symmetric.
ii. Symmetric but neither reflexive nor transitive.
iii. Reflexive, Symmetric and transitive
Q54. Functions f, g and h are defined on the set X= {1,2,3} as:
f= {(1,3) (2,1) (3,2)};
G= {(1,2) (2,3) (3,1)};
H= {(1,2) (2,1) (3,3)}
Find fog and gof are the equals?
Find fogoh and fohog?
Q55. Find the GCD (252,105) using Euclid’s Algorithm.
Q56 Prove that Fermat's theorem hold true for p = 5 and a = 2.
Q57. Show that (G, +8) is an abelian group where: G= {0,1,2,3,4,5,6,7}
Q58. Show that (F, +, *) is a field where F is set of all rational numbers and + and * are
ordinary additional and multiplication operators?
Q59 Find Φ (35) using Euler’s Totient function.
Q60 Find the GCD (750,900) using Euclid’s Algorithm.
Q61. Solve the following equations using CRT.
X ≡ 2 (mod 3)
X ≡ 3 (mod 5)
X ≡ 2 (mod 7)
Q62. Define the following terms with suitable example
i. Monoid
ii. Group
iii. Ring
iv. Semigroup
v. Subgroup
Q63. Show the binary search tree after inserting 3, 1,4,6,9,2,5,7 into an initially empty
binary search tree.
Q64. We will calculate the shortest path between node C and the other nodes in the graph.

Q65. A simple graph G has 24 edges and degree of each vertex is 4. Find the number of
vertices.
Q66 How many edges are there in a graph with 10 vertices of degree six?
Q67 If a graph has 5 vertices, can each vertex have degree 3?
Q68 A graph contains 21 edges, 3 vertices of degree 4 and all other vertices of degree 2.
Find total number of vertices.
Q69. Are the following two graphs isomorphic?

Q70. Prove the statement is true using mathematical induction: n^3 + 2n is divisible by 3
for all n>=1.