Scribd
Upload
38 views2 pages

AprilMay 2023

Uploaded by

nikilnitish134
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
38 views2 pages

AprilMay 2023

Uploaded by

nikilnitish134
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/ 2

Code No: 153CF R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


B. Tech II Year I Semester Examinations, April/May - 2023
DISCRETE MATHEMATICS
JN
(Computer Science and Engineering – Artificial Intelligence and Machine Learning)
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.
H
PART – A
(25 Marks)
U
1.a) Define the disjunction of two proportions and give its truth table. [2]
b) Define a predicate and give an example for a predicate. [3]
se
c) Define a set and give an example. [2]
d) Define an equivalence relation and give an example. [3]
e) Write the steps involved in strong induction. [2]
Give a big-O estimate for f ( x)  ( x  1) log( x2  1)  3x2 .
d
f) [3]
g) Write the axioms of probability. [2]
h) What is the generating function? [3]
pa
i) Define a graph. [2]
j) Define a spanning tree and a minimal spanning tree. [3]
pe
PART – B
(50 Marks)

2.a) Define a tautology and a contradiction and give their truth tables.
rs
b) Use quantifiers to express the definition of the limit of a real-valued function f (x) of a
real variable x at a point a in its domain. [5+5]
OR
20
3. Show that ( x)  P( x)  Q( x)   ( x) Q( x)  R( x)   ( x)  P( x)  R( x)  . [10]

4. Define a function. List all possible functions from X  {a, b, c} to Y  {0,1} and
23
indicate in each case whether the function is one-to-one, is onto, and is one-to-one onto.
[10]
OR
5. Let A  {a, b, c} and the subsets of A are denoted by B0   , B1  {c} , B2  {b} ,
B3  {b, c} , B4  {a} , B5  {a, c} , B6  {a, b} , and B7  {a, b, c} . If R is the relation of
proper inclusion on the subsets B0 , B1 ,....., B7 , then give the matrix of this relation.
[10]
6.a) Let f ( x)  an x n  an1 x n1  an2 x n2  ...  a1x  a0 where a0 , a1 ,..., an1 , an are real
n
numbers then prove that f ( x) is O( x ) .
b) Use mathematical induction to show that 1  2  22  ...  2n  2n1  1 for all nonnegative
JN
integers n. [5+5]
OR
7.a) List all the steps used to search for 9 in the sequence1, 3, 4, 5, 6, 8, 9, 11 using (i) a
linear search (ii) a binary search.
TU
b) 
Show that whenever n  3, f n   n2 , where   1  5 / 2.  [5+5]

8. State and prove Baye’s theorem. [10]


H
OR
9. Solve the recurrence relation an  6an1  9an2 with initial conditions ao  1
U
and a1  6 . [10]
se
10. Show that the following graphs are isomorphic. [10]
d
pa
pe
OR
11. Discuss DFS and BFS algorithms. Using DFS and BFS algorithms, construct the
rs
spanning tree of the following graph. [10]
20
23

---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