Code No: 154AQ R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B. Tech II Year II Semester Examinations, April/May - 2023
DISCRETE MATHEMATICS
(Common to CSE, IT, ITE, CE(SE), CSE(CS), CSE(N))
JN
Time: 3 Hours Max. Marks: 75

Note: i) Question paper consists of Part A, Part B.

TU
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks
and may have a, b as sub questions.

PART – A
H
(25 Marks)

1.a) Define Tautology with suitable example. [2]

U
b) Write contra positive of the conditional statement:
P: 2+2=4, q: I am not the Prime Minister of India. [3]
se
c) Define binary relation . [2]
d) If A={α,β}, B={1,2,3}. Find out (AxB) U (BxA) and (AxB) ∩ (BxA). [3]
e) What is recursive algorithm? [2]
d
f) Write the Principle of Mathematical Induction. [3]
g) Write Fibonacci Recurrence Relation. [2]
h) What is inclusion-exclusion? [3]
pa
i) What is planar graph? [2]
j) Define shortest path algorithm. [3]
pe
PART – B
(50 Marks)
rs
2.a) Prove that (∀𝑥)(𝑃(𝑥) ∨ 𝑄(𝑥)) ⟹ (𝑥)𝑃(𝑥) ∨ (∃𝑥)𝑄(𝑥)
b) Show that 𝑟 ∧ (𝑝 ∨ 𝑞) is a a valid conclusion from the premises
(𝑝 ∨ 𝑞), (𝑞 → 𝑟), (𝑝 → 𝑚) 𝑎𝑛𝑑 (~𝑚). [5+5]
OR
20
3.a) Verify the following argument is valid by translating into symbols and using rules of
inference
If Clifton does not live in Franc, then he does not speak French
23
Clifton does not drive a Datsum
If Clifton lives in France, then he rides a bicycle
Either Clifton speaks French, or he drives a Datsun
Hence, Clifton rides a bicycle.
b) Show that 𝑟 ∧ (𝑝 ∨ 𝑞) is a a valid conclusion from the premises
(𝑝 ∨ 𝑞), (𝑞 → 𝑟), (𝑝 → 𝑚) 𝑎𝑛𝑑 (~𝑚). [5+5]

4. Show that congruence modulo m is an equivalence relation on integers. [10]

OR
5.a) If R is a relation on a set A, then R is transitive if and only if 𝑅 2 ⊆ 𝑅
b) Consider the following relation on {1,2,3,4,5,6}, 𝑅 = {(𝑖, 𝑗): |𝑖 − 𝑗| = 2} Is R transitive?
Is R reflexive? [5+5]
6.a) Suppose the postal department prints only 5 and 9 cent stamps. Prove that it is possible
to make up any postage of n cents using only 5 and 9 cent stamps for 𝑛 ≥ 35.
b) Give a recursive definition of the: i) the set of even integers ii) the set of positive integers
congruent to 2 modulo 3. iii) the set of positive integers not divisible by 5. [5+5]
JN
OR
7.a) Give a recursive algorithm for finding the sum of the first n positive integers.
b) Use mathematical induction to prove that the statement [5+5]
𝑛 𝑛
TU
𝑥 − 𝑦 is a factor of polynomial 𝑥 − 𝑦

8. Solve the recurrence relation of the Fibonacci series of numbers. [10]

OR
H
9. Use generating functions to solve the recurrence relations
𝑎𝑟 = 𝑎𝑟−1 + 𝑎𝑟−2 with 𝑎1 = 2 𝑎𝑛𝑑 𝑎2 = 3 [10]

10.a) Show that a graph 𝐾𝑛 has a Hamiltonian cycle whenever 𝑛 ≥ 3.

U
b) Show that 𝐾5 is an Euler’s circuit and also Hamiltonian cycle. [5+5]
OR
se
11. Verify whether the graphs G and G1 are isomorphic or not. Explain the reason. [10]
d
pa
G G1
pe
---ooOoo---
rs
20
23