Guru Nanak Institutions Technical Campus (Autonomous)

School of Engineering & Technology

Date: 15/6/24
Question Bank / Previous Question Papers questions

Academic Year : 2023-24

Subject Name with code : DISCRETE MATHEMATICS
Class : II CSE(DS)-1,2
Name of the Faculty Member : G SUSHMA/ Y SINDHURA

BTL- Blooms Taxonomy Level

Level 1 – Remembering
Level 2 – Understanding
Level 3 – Applying
Level 4 – Analyzing
Level 5 – Evaluating
Level 6 - Creating
BTL Course
level Outcome
Questions
Sl. (Please (Please
(Select Questions from University question Bank and mention year in
No. mention mention
bracket or you may give own standard question with (new) in bracket)
L1 or L2 CO1, CO2,
or etc...) etc…)
UNIT – I
Part – A (2 Marks)
Write the converse and contra positive of the statement:
1 L2 CO1
“If P is a square, then P is a rectangle”.
2 Construct the truth table of the compound proposition (p v ┐q)  (p ^ q) L2 CO1
3 Define tautology with suitable example L2 CO1
4 Construct a truth table for the compound proposition: (P ^ Q)(P v Q) L3 CO1
Represent the proposition “If all triangles are right angled, then no
5 L2 CO1
triangle is Equiangular” into symbolic form and also its negation.
Provide a proof by contradiction of the following statement
6 L3 CO1
“For every integer n, if n2 is odd then n is odd”
Verify whether the following formula is tautology or not
7 L2 CO1
[(p→r) ʌ(q→r)] →[(pvq) →r]
8 State and explain the rules that can generate a well formed formula. L1 CO1
Construct truth table for the following
9 L2 CO1
i. ~ (P ʌ Q) v ~(Q↔P) and ii. [(P^Q)v( ~R)] ↔P
If P is true , Q is false and R is true , then find the truth value of ((P ^ Q)
10 L2 CO1
→ R) V (P V R) without constructing the truth table.
Part – B (5 Marks)
Verify whether the following formula is tautology or not
1 L2 CO1
[(p→r) ʌ(q→r)] →[(pvq) →r]
Obtain the Principal conjunctive Normal Form (PCNF) of the following:
2 L1 CO1
(p  (q ^ r)) ^ (┐p(┐q ^ ┐r))
 Obtain PCNF and PDNF by using truth table for the formula
3 L2 CO1
(P → Q) V (Q ↔ R)
Prove that P  S can be derived from the premises ┐P v Q, ┐Q v R, R S
4 using rules of inference.
L2 CO1
5 Show that p  (q r) ≡ (p ^ q)  r L3 CO1
Show that r ^ (p v q) is a valid conclusion from the premises
6 L2 CO1
(p v q), (q  r), (p  m) and (┐m)
Obtain the Principal Disjunctive Normal Form (PDNF) of
7 L2 CO1
(p ^ q) v (┐p ^ r) v (q ^ r)
8 Show that ┐(p v ( ┐p ^ q ) ) and ( ┐p ^ ┐q ) are logically equivalent. L2 CO1
Prove or disprove the following statements:

9  All men are mortal L3 CO1

 All kings are men
 Therefore, All kings are mortal
Obtain principal disjunctive normal form (PDNF) for the following
formula:
10 L2 CO1
i) using truth table ii) without using truth table
P → [( P → Q) ^ ~ ( ~ Q V ~ P)]
UNIT – II
Part – A (2 Marks)
Let I= {0,1,2} and define functions f and g from I to I as follows for all x
1 L2 CO2
in I, f(x)= (x2+x+1) mod 3 and g(x)= (x+2)2 mod 3, state whether f=g.
Compute the transitive closure of the relation R={(1,1),(1,2),(1,3),(2,3),
2 L2 CO2
(3,1)} defined over a set S={1,2,3}.
Let A = {1, 2, 3, 4} show that the relation “divides” is a partial ordering
3 L2 CO2
on A. Draw the Hasse diagram.
Draw the Hasse diagram for the divisibility on the set {1,2,3,6
4 L3 CO2
12,24,36,48,96}
Draw the hasse diagram for X={2,3,6,24,36,48} and relation ≤ be such
5 L2 CO2
that x ≤ y, if x divides y.
6 Define binary relation. L2 CO2
7 Let A= {1,2,3,4}, B= {3,4,5,6}. Find AUB, A-B. L3 CO2
8 Define equivalence relation.
9 Let f(x): x2-3x+2, find f(x2) and f(x+3). L1 CO2
10 Define Power set. Find the power set of S={a,b,c}. L2 CO2
Part – B (5 Marks)
1 State and Explain the properties of binary relations. L1 CO2
Let A={1,2,3,4}, R={(1,1),(1,2),(2,2),(2,4),(1,3),(3,3),(3,4),(1,4),(4,4)
2 L2 CO2
Verify that R is a partial ordering relation on A.
Let A = {1,2,3,4}, B = {a,b,c,d} and C = {x,y,z}. Consider the function
3 f: A→B and g:B→C defined by f = {(1,a),(2,c),(3,b),(4,a)} and L2 CO2
g= {(a,x),(b,x),(c,y),(d,y)}. Find the composition function (gof).
4 Define Hasse diagram. L2 CO2

Let X={2,3,6,12,24,36} and a relation ′≤’ be such that x ≤ y, if x divides

 y. Draw Hasse diagram of (x,≤).
5 State and explain the properties of binary relations L2 CO2
What is Equivalence relation?
6 L2 CO2
Prove that R={(1,1), (1,2), (2,1), (2,2), (3,3), (3,4), (4,3), (4,4), (5,5),
(5,6), (6,5), (6,6)} is Equivalence relation.
Draw the Hasse diagram for the relation R={(x,y) | x divides y} on
7 ={2,3,6,12,24,36}. L2 CO2

8 Define function. Explain different types of functions. L3 CO2

Define Partial ordering relation. The digraph for a relation on set
A={1,2,3,4} is as shown below.

9 L2 CO2

Verify that (A,R) is a POSET?

10 Show that A – (B U C) = ( A – B) ∩ ( A – C ) using an example. L2 CO2
11 Define a poset. Give any two partial ordering relations. L2 CO2
If A={α,β} and B={1,2,3}. Compute AXB, BXA, AXA, BXB and
12 L2 CO2
(AXB)∩(BXA).
14 Let f: R→R be given by f(x) = x3-2. Find f -1. L2 CO2
16 Draw Hasse diagram for factors of 210. L3 CO2
Show that R is Equivalence relation, where R= {(a,a),(a,b),(b,a),(b,b),
17 L2 CO2
(c,d),c,c),(d,c),(d,d)}.
UNIT – III
Part – A (2 Marks)
1 Define Lattice. L1 CO2
2 What is monoid? L1 CO2
3 Define group. L1 CO2
4 Define Lattice and write its properties. L1 CO2
5 Define Least upper bound and Greatest lower bound. L1 CO2
6 Define Abelian Group. L1 CO2
7 Define Semi Group. L1 CO2
8 Define Sub Group. L1 CO2
9 Define Lattice Homomorphism L1 CO2
10 What is Boolean Algebra? L2 CO2
Part – B (5/7/10/14 Marks)
1 State and Explain the Properties of Algebraic System. L1 CO3
2 Prove that (Z,*) is a group , where * is defined by a*b=a+b+1. L2 CO3
Verify whether G = {1,2,3,4,5,6} is an group under multiplication
3 L2 CO3
module 7.
4 Show that set Natural numbers (N) is a monoid with respect to L2 CO3
 multiplication.
Show that the set of N natural numbers is a semi group under the
5 L3 CO3
operation x*y=max{x,y}. Is it a monoid? Why or why not?
Verify the following system is group or not.
6
Let G={1,2,3,4,5} and the operation +6, Where +6 represents additive
modulo 6.
On the set Q of all rational numbers, the operation * is defined by a*b
7 L2 CO3
=(ab)/2. Show that, under this operation, Q forms a abelian group.
Define a) Direct product of Lattice
b) Sub Lattice
8 L2 CO3
c) Sub Lattice
d) Lattice homomorphism
Let L={1,2,3,5,30} and R be the relation “is divisible” defined on L.
9 L3 CO3
Show that L is Lattice or not.
Prove that i) a+(a' *b) = a+b
10 L2 CO3
ii) a*( a'+b)=a*b
11 State and prove Demorgan’s Law in Boolean algebra.. L3 CO3
UNIT – IV
Part – A (2 Marks)
1 State principle of inclusion-exclusion. L1 CO 4
2 How many words of three distinct letters can be formed from CAKE? L2 CO 4
3 State the sum rule and product rule for counting problems. L1 CO 4
4 List the 3-combinations of 3a’s, 2b’s and4c’s. L2 CO 4
Find out how many 5-digit numbers greater than 30,000 can be formed
5 L2 CO 4
from the digits 1,2,3,4 and 5.
Show that at least 2 people out of 13 must their birthday in the same
6 L3 CO 4
month when they are assembled in the same room.
7 How many different bit strings are there of length 9? L2 CO 4
8 State the sum rule for counting problems. L2 CO 4
9 Find the number of 5-permutations of a set with 9 elements. L2 CO 4
10 Find the coefficient of X20 in (X3 + X4 + X5 +…..)5. L3 CO 4
Part – B (5/7/10/14 Marks)
In a class of 50 students, 20 students play football and 16 students play
1 hockey. It is found that 10 students play both the games. Find the number L1 CO 4
of students who play neither.
2 How many positive integers not exceeding 2000 are divisible by 7 or 11? L1 CO 4
3 Find the expansion of (x+y)6 using binomial theorem. L2 CO 4
4 Using Multinomial theorem expand (2x-3y+4z)3. L2 CO 4
There are 3 boxes of identical red, blue and white balls, where each box
contains atleast 10 balls. How many ways are there to select 10 balls if
i)there is no restriction?
5 L3 CO 4
ii)atleast one white ball must be selected??
iii) exactly one red ball must be selected
iv)atmost one white ball is selected?
6 Suppose repetitions are not permitted, answer the following questions: L3 CO 4
i) How many three-digit numbers can be formed from the six digits 2, 3,
5, 6, 7 and 9?
ii) How many of these numbers are less than 400?
 iii) How many of these are even?
The question paper of DM comprises questions divided into 2 groups of
7 5 questions each. In how many ways can an examine answer 6 questions L3 CO 4
taking at least 2 questions from each group?
Show that if any 5 integers from 1 to 8 are chosen, then at least 2 of them
8 L3 CO 4
will belong to the same set having a sum 9.
How many bit strings of length 8 contain
i)exactly five 1’s?
9 ii)an equal number of 0s and 1s? L3 CO 4
iii)atleast four 1s?
iv)at least three 1s and atleast three 0s?
Suppose a department consists of 10 men and 15 women. How many
10 ways are there to form a committee with 6 members if it must have 3 L3 CO 4
men and 3 women?
UNIT – V
Part – A (2 Marks)
1 What is a planar graph? Give examples of planar and non-planar graphs. L1 CO 5
2 Define a spanning tree. L1 CO 5
Find the cut vertices and cut edges in the following graph. [Nov 2015-
R13]

3 L2 CO 5

4 Differentiate DFS and BFS. L1 CO 5

5 What do you mean by chromatic number? L1 CO 5
6 Define Complete Bi-Partition graph with an example. L2 CO 5
7 Define Sub graph, Multi grap L1 CO 5
8 Define Minimum spanning tree. L1 CO 5
9 Prove that K5 is not planar. L3 CO 5
10 How many edges does a spanning tree of Km,n. L2 CO 5
Part – B (5/7/10/14 Marks)
What are the various representations for a graph? Give their advantages
1 L1 CO 5
& disadvantages.
Explain Kruskal’s algorithm for spanning trees with an example of your
2 L2 CO 5
own.
Find the preorder, inorder and post order traversals for the following tree:

3 L3 CO 5

4 What do you mean by chromatic number? Find the chromatic number of L2 CO 5

the following graph:
 Determine whether the graphs shown in below figure are isomorphic.

5 L1 CO 5

Explain the minimum spanning tree for the following graph using Prims
algorithm:

6 L3 CO 5

Find the indegree and out degree of each of the vertices of the following
graph and verify that sum of indegree = sum of out degree

7 L3 CO 5

Construct spanning tree by applying BFS algorithm on the following

graph. Follow alphabetical order :

8 L3 CO 5

What is a Hamiltonian Cycle? Draw bipartite graph K3, 4 and prove that
9 this graph does not have a Hamiltonian cycle. L2 CO 5

10 Define complete, euler and bipartition graph. L1 CO 5