(Page 1 of 4)

18MA31CS/IS
USN

Third Semester B. E. Degree (Autonomous) Examinations Dec 2021-22

(Computer Science and Information Science Branches)
DISCRETE MATHEMATICAL STRUCTURES
Model Question Paper -2

Time: 3 Hours Maximum Marks: 100

Note: 1. Answer FIVE FULL questions.

2. Answer ANY ONE from Question No. 1 and 2.
3. Answer ANY ONE from Question No. 3 and 4.
4. Answer ANY ONE from Question No. 5 and 6.
5. Answer ANY ONE from Question No. 7 and 8.
6. Answer ANY ONE from Question No. 9 and 10.

RBT
Q. No. Questions Marks CO
Level
1. a)
Define Contradiction. Construct the truth table for the
compound statement ∼ ( p ∨∼ q ) → ∼ q . 06 CO1 L2

b)
Establish the validity of the following argument.
p →r
∼ p→q
q⟶ s 07 CO3 L2
-------------------------------
∴∼r⟶ s

Symbolize using quantifiers and negate:

c)
i. For any integers k, m, n , if k-m and m-n are
odd then k-n is even.
07 CO2 L3
ii. For all real numbers x, if then
.
OR
2. a)
Write the converse, inverse and contrapositive of the
3π 06 CO1 L2
statement, If −1<3 and 3+7=10 then sin =−1.
2

Consider the statement “In triangle ABC there is no pair of

b) angles of equal measures. If a triangle has two sides of equal
07 CO3 L3
length then it is isosceles. If the triangle is Isosceles then it has
two angles of equal measure. Therefore, triangle ABC has no
two sides of equal lengths. Establish the validity of the argument.

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 2 of 4)

c) Let p ( x ) : x 2−8 x +15=0; q ( x ) : x is odd; r ( x ) : x >0 . For the

universe of all integers determine the truth values of the
following statement. If the statement is false then give the
counter example. 07 CO2 L2
1. ∀ x [ p ( x )→ q ( x )]
2. ∀ x [q ( x ) → p ( x ) ]

3 a) If U ={ 0 ,1 , 2 ,3 , 4 , 5 }, A={0 , 1 ,2 }, B={2 ,3 , 4 } then find

i. A∪B
ii. A∩B 06 CO2 L2
iii. A−B
'
iv. ( A ∪ B)
b) Using laws of set theory prove that
A Δ B = Ā Δ B = A Δ B̄. 07 CO1 L2

c) A certain question paper contain three parts A,B,C

with three questions in part A, five questions in part
B and four questions in part C. It is required to
07 CO1 L3
answer seven questions selecting atleast two
questions from each part. In how many different
ways can a student select seven questions?
OR
4 a) Let U be the universal set. If A, B and C are any three
subsets of U, then using the laws of set theory prove that 06 CO2 L2
A ∪ ( B∩ C )= ( A ∪ B ) ∩( A ∪ C ).

b) Prove that P ( A ∩B )=P( A)∩ P(B) 07 CO1 L2

How many odd number less than 10000 can be formed using the
c) digits 0, 2, 5, 7 (repetition of digits is allowed). How many of 07 CO1 L3
them contain 4 digits?
State and Prove principle of mathematical induction.
5 a)
06 CO2 L2

b) For all , by using the principle of mathematical induction,

07 CO2 L2
prove that
For all , where , prove that can be written as
c) a sum of 3’s and/or 8’s. 07 CO2 L3

OR
Give recurrence relation for the following 06 CO2 L2
6 a) 1. a n=7 n
2. b n=7n

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 3 of 4)

3. C n=2−(−1)n

b) For , let denote the nth Fibonacci number. Prove that

07 CO2 L3

Using mathematical induction, show that is divisible by CO2 L3

c) 07
3 where is a positive integer.
7 a) Show that the chromatic polynomial of a tree on n vertices is
given by Pn ( λ ) =λ( λ−1)
n−1 06 CO3 L2

b) Prove that the graph K5 and K3,3 are non planer. 07 CO3 L2

c) Define the following with an example

i. Walk
ii. Bipartite graph 07 CO4 L3
iii. Isomorphic graphs
iv. Planar graph
OR
8 a) If is a connected plane graph with p-vertices, q-edges 06 CO3 L2
and r-regions then prove that p-q+r=2.
b) Prove that for every graph with six points either or 07 CO3 L3
contains a triangle.
c) Prove that a graph G is bipartite if and only if it does not contain
an odd cycle.
07 CO4 L2

9 a) Define cut set with an example. Prove that an Euler graph cannot
have a cutest with an odd number of edges.
06 CO4 L2
Develop a Prefix code and Encode the message “BE INDIAN”.
b) 07 CO4 L3
c) Using Kruskal’s algorithm find the minimum spanning tree of
the graph below

07 CO5 L3

1 a) Using the prim’s algorithm find the minimum spanning tree of 06 CO4 L3
0 the graph below

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 4 of 4)

Prove that a connected graph G is a tree if and only if there

b) exists a unique path between every vertex of G. 07 CO4 L2
c) Prove that addition of an edge to a tree gives exactly one cycle in
G.
07 CO5 L2

*******

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)