Scribd
Upload
16 views1 page

JulyAugust 2021

March

Uploaded by

pallesirisha40
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views1 page

JulyAugust 2021

March

Uploaded by

pallesirisha40
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: 154AQ R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B. Tech II Year II Semester Examinations, July/August - 2021
DISCRETE MATHEMATICS
(Common to CSE, IT)
Time: 3 Hours Max. Marks: 75
JN
Answer any five questions
All questions carry equal marks
---
1.a) Give a direct proof and an indirect proof, “If 𝑛 is an odd integer, then (𝑛 + 9) is an even
TU
integer”.
b) Show the following statement is a tautology.
¬𝑃 ∧ ( ¬𝑃 ∧ 𝑄) → ¬𝑄 [7+8]
H
2.a) Let 𝑋 = 1,2,3,4,5,6,7 𝑎𝑛𝑑 𝑅 = 𝑥, 𝑦 | 𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3 in X. Show that R is
an equivalence relation.
b) Let the function 𝑓: 𝑁 → 𝑁 and 𝑔: 𝑍 → 𝑁 be defined as follows
U
𝑓 𝑥 = 3𝑥 + 2 and 𝑔 𝑥 = 𝑥 2 + 1 specify the functions.
i) 𝑓 𝑜 𝑔 ii) 𝑔 𝑜 𝑓.
se
If they exist, and give a valid argument if one/some of them do not exist. [7+8]

3. Check whether proposition ∼ 𝐴 ↔ 𝐵 ∧ 𝐶 ∨ ∼ 𝐴 → 𝐵 is well-formed, providing


d
step-by-step tracing of the algorithm. [15]

4.a) Explain the principle of strong induction with example.


24
b) Using induction principles prove that 𝑛3 + 2𝑛 is divisible by 3. [7+8]

5. Find the general solution for the recurrence relation.


𝑇 𝑛 − 𝑇 𝑛 − 1 = 4(𝑛 + 𝑛3 ), where 𝑛 ≥ 1, and 𝑇 0 = 5.
-0
[15]

6.a) How many solutions does 𝑥1 + 𝑥2 + 𝑥3 = 11 have, where 𝑥1 , 𝑥2 , 𝑎𝑛𝑑 𝑥3 are nonnegative
7-
integers with 𝑥1 ≤ 3, 𝑥2 ≤ 4, 𝑎𝑛𝑑 𝑥3 ≤ 6?
b) How many bits of string of length 10 contain
i) Exactly four 1‟s ii) At most four 1‟s. [7+8]
21
7. Define Graph. Graph „G‟ is represented by the following adjacency matrix.
0 1 1 1 01 0 1 0 11 1 0 0 11 0 0 0 10 1 1 1 0
a) Draw the Graph.
AM
b) Determine whether G is a tree. Justify your answer?
c) Determine whether G is Eulerian graph. Justify your answer?
d) Determine whether G is Hamiltonian graph. If it is so, provide a Hamiltonian cycle on
G. [3+4+4+4]

8. Show, step by step kruskal‟s algorithm on the following connected weighted graph and
also calculate sum of the weights of the minimal spanning tree? [15]

---ooOoo---

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy