Code No: 5858AB R22

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

M.Tech I Semester Examinations, March - 2023
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science and Engineering)
JN
Time: 3 Hours Max. Marks: 60

Note: This question paper contains two parts A and B. i) Part- A for 10 marks, ii) Part - B for 50
TU
marks.
 Part-A is a compulsory question which consists of ten sub-questions from all units carrying
equal marks.
 Part-B consists of ten questions (numbered from 2 to 11) carrying 10 marks each. From
H
each unit, there are two questions and the student should answer one of them. Hence, the
student should answer five questions from Part-B.
U
PART - A
(10 Marks)
se
1.a) Define the term Predicate. [1]
b) What is meant by contradiction? [1]
c) What is meant by onto function? Give an example. [1]
d
d) What is meant by Symmetric closure of a relation? [1]
e) What is meant by induction hypothesis? [1]
pa
f) Write a brief note on proof by well-ordering property. [1]
g) State Baye’s theorem. [1]
h) Define the term Expected value. [1]
i) What is Hamilton path? [1]
pe
j) Define the term Planar graph. [1]
PART - B
(50 Marks)
rs
2.a) Show that P→(Q→R) ⇔ P → (┐Q ∨ R) using equivalent formulas.
b) Show the following equivalences without constructing truth tables: [4+6]
i) ┐(P ∧ Q) ⇔ (┐P V ┐Q) ii) ┐(P V Q) ⇔ (┐P ∧ ┐Q)
OR
20
3.a) Show that R→S can be derived from the premises P → (Q → S), ┐R V P , and Q, using
rules of inference.
b) Show that Ɐx (P(x) V Q(x))  Ɐx P(x) V  x Q(x). [5+5]
23
4.a) Let f1(x) = x+ 4, f2(x) = x – 4, and f3(x) = 4x for x ϵ R, where R is the set of real numbers.
Find fog and gof.
b) Let R = {(b,c),(b,e),(c,e),(d,a),(c,b),(e,c)} be a relation on the set A = {a,b,c,d,e}. Find the
transitive closure using Warshall’s algorithm. [4+6]
OR
5.a) Let A = Z, the set of integers, and let R be defined by a R b iff a ≤ b. Is R an
equivalence relation.
b) What is an n-ary relation? Explain the properties and applications of n-ary relations. [5+5]
6.a) Write down the recursive algorithm for generating Fibonacci series and explain the process.
b) Devise an algorithm for finding the minimum (smallest) value in a finite sequence of
integers. [5+5]
OR
7. Prove that every integer greater than or equal to 2 can be factored into primes using
JN
mathematical induction. [10]

8.a) A sequence of 10 bits is randomly generated. What is the probability that at least one of
TU
these bits is 0?
b) Solve the recurrence relation an –5an-1 +6an-2 = 0 where a0 =2 and a1 =5, n≥0. [5+5]
OR
9.a) Explain the divide and conquer strategy for binary search algorithm with an illustrative
H
example.
b) Using generating function, solve the yn+2 – 4yn+1 + 3yn = 0, given y0 = 2, y1 = 4. [5+5]

10.a) Find whether the two given graphs G and G1 are isomorphic or not.
U
se
Graph G Graph G1
Determ Determine
ine whether the
d
whethe two given
r the graphs G
two and G1 are
pa
given isomorphic
graphs or not. [7]
G and
pe
G1 are
isomor
phic or
not. [7]
rs
b) Discuss graph coloring problem with an example. [5+5]
OR
11. Explain various tree traversal techniques with an illustrative example. [10]
20
23
---ooOoo---