Code No: R2021054 R20 SET - 1

II B. Tech I Semester Regular/Supplementary Examinations, December-2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CSE, CST,CSE(AI),CSE(AIML),AI,DS,CSE(AIDS),CSE(CS), CSE(DS), CSE(IOTCSBT),
CSBS,CSE(IOT),AIDS,AIML, CS(CSD))
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
UNIT-I
1 a) Obtain the conjunctive normal form of the formula [7M]
(~P V ~Q)→(P ↔ ~Q)
b) “If there was a ball game, then travelling was difficult. If they arrived on time, [7M]
then travelling was no difficult. They arrived on time. Therefore, there was no
ball game.” Show that these statements constitute a valid argument.
OR
2 a) Obtain the PDNF for (PΛQ)V(¬PΛR)V(QΛR) [7M]
b) Symbolize the expressions [7M]
i) All the world loves a lover
ii) All men are giants
UNIT-II
3 a) Define the following terms (i) Abelion Group (ii) Sub Group [7M]
b) Let X={1,2,3,4} if R={(x,y)|(x-y) is integer non zero multiple of 2} and [7M]
S={(x,y)|(x-y) is integer non zero multiple of 3} find R U S and R ∩ S.
OR
4 a) If R be an equivalence relation in a set A, then R-1 is also an equivalence relation [7M]
in A.
b) Prove that A= (A∩B)U (A-B) for any two sets A and B [7M]

UNIT-III
5 a) In how many ways can 23 different books be given to 5 students so that 2 of the [7M]
students will have books each and other 3 will have 5 books each.
b) Find the greatest common divisors of the following pairs of integers 81 and 36. [7M]

OR
6 a) How many ways can we distribute 14 indistinguishable balls in 4 numbered [7M]
boxes so that each box is non empty?
b) How many integral solutions are there x1 + x2 + x3 + x4 + x5 = 20 where each [7M]
x1≥3 , x2≥2, x3≥4, x4≥6, and x5≥0
UNIT-IV
7 a) Solve an+7an-1+8an-2=0 for n≥2 , a0=1, a1=-2 using generating functions. [7M]
b) Solve the recurrence relation an - 6 an-1 + 9 an-2 =0 [7M]
OR
1 of 2
|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 1

8 a) Solve an = (an-1)2(an-2)3 where a0=4 and a1=4 [7M]

b) Solve the recurrence relation of Fibonacci series with F0 = 1, F1 = 1 [7M]

UNIT-V
9 a) Explain Kruskal’s algorithm to find the minimal spanning tree with an example. [7M]
b) Show that the graph on the left is Hamiltonian, but that the other two are not. [7M]

OR
10 a) Suppose that G is a non directed graph with 12 edges. Suppose that G has 6 [7M]
vertices of degree 3 and the rest have degree less than 3. Determine the
minimum number of vertices G can have.
b) Explain Breadth First Search Algorithm with suitable example. [7M]

2 of 2

|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 2

II B. Tech I Semester Regular/Supplementary Examinations, December-2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CSE, CST,CSE(AI),CSE(AIML),AI,DS,CSE(AIDS),CSE(CS), CSE(DS), CSE(IOTCSBT),
CSBS,CSE(IOT),AIDS,AIML, CS(CSD))
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

UNIT-I
1 a) Obtain the principal disjunctive forms of the formula [7M]
(~P V ~Q)→(P ↔ ~Q)
b) Prove or disprove the validity of the following arguments [7M]
Some dogs are animals.
Some cats are animals.
Therefore, some dogs are cats
OR
2 a) What is propositional logic? List and explain laws of propositional logic. [7M]
b) Show that (x) ( P(x) → Q(x)) Λ (Q(x) → R(x)) => (P(x) → R(x)) [7M]

UNIT-II
3 a) Define a Monoid ? Give an example of a Monoid which is not group. [7M]
b) Show that R ∩ S is reflexive if R and S are reflexive on a set A. [7M]
OR
4 a) Show that the relation R={(a,b) | a-b is divisible by n} is an equivalence [7M]
relation on the set of integers where n be a positive integer greater than 1.
b) What are the identity and inverse elements under * defined by [7M]
a*b= ab/2 Va,b ε R
UNIT-III
5 a) What is the coefficient of x3y7in (x+y)10 [7M]
b) In how many ways can 14 people be partitioned into 6 teams when the first and [7M]
second have 3 members each and third, fourth, fifth and sixth teams have 2
members each
OR
6 a) How many ways can the letters of the word ALGORITHM be arranged in a row [7M]
if A and L must remain together as a unit
b) How many integral solutions are there x1 + x2 + x3 + x4 + x5 = 20 where each xi≥2 [7M]

UNIT-IV
7 a) Solve an-9an-1+26an-2 -24an-3 =0 for n≥3 by generating functions. [7M]
b) Solve the recurrence relation an - 8 an-1 + 21 an-2 - 18 an-3 =0 for n ≥ 3 [7M]

OR

1 of 2
|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 2

8 a) Solve nan + (n-1)an-1 = 2n where a0=1 [7M]

b) Solve an - 2an-1 - 3an-2 = 0 , n≥2, given a0 = - 2, a1 = 1 [7M]

UNIT-V
9 a) Determine whether the following graphs are isomorphic or not. [7M]

b) Draw the binary tree whose level order indices are { 1,2,4,5,8,10,11,20 } [7M]

OR
10 a) What is Planar Grpah? Find whether K5 is planar or not. [7M]
b) How many different non-isomorphic trees are there of order [7M]
i) 2 ii) 5

2 of 2

|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 3

II B. Tech I Semester Regular/Supplementary Examinations, December-2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CSE, CST,CSE(AI),CSE(AIML),AI,DS,CSE(AIDS),CSE(CS), CSE(DS), CSE(IOTCSBT),
CSBS,CSE(IOT),AIDS,AIML, CS(CSD))
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
UNIT-I
1 a) Obtain the principal conjunctive normal forms of the formula [7M]
Q Λ (P V ~Q)
b) Without using the truth table, prove that ¬ p → q → r ≡ q → p v r [7M]

OR
2 a) Express P ↑ Q in terms of ↓ only. [7M]
b) Show that S V R is tautologically implied by (P V Q) Λ (P → R) Λ (Q → S) [7M]
using Automatic Theorem Proving
UNIT-II
3 a) Let A= {2,4,6,8,10,12}, show that the relation ‘divides’ is a partial ordering on [7M]
A and draw Hassie diagram
b) Show that R ∩ S is symmetric if R and S are symmetric on a set A. [7M]

OR
4 a) If (G, *) is an abelian group, show that a * b2 = a2 * b2 [7M]
b) Let X={1,2,3,4} if R={(x,y)|(x-y) is integer non zero multiple of 2} and [7M]
S={(x,y)|(x-y) is integer non zero multiple of 5} find R U S and R ∩ S
UNIT-III
5 a) Find the number of non negative integral solutions to X1+X2+X3+X4+X5=10 [7M]
b) Find the coefficient of x14x25x36x43 in (x1 + x2 + x3 + x4)18 [7M]

OR
6 a) How many integral solutions are there of x1 + x2 + x3 + x4 + x5 = 30 where for [7M]
each i, xi ≥ 1
b) In how many ways can 14 people be distributed into 6 teams where in some [7M]
order 2 teams have 3 each and 4 teams have 2 members each
UNIT-IV
7 a) What are second order linear homogeneous recurrence relations? Give the [7M]
general solution for them.
b) Solve the recurrence relation an +an-1 -6an-2=0 for n≥2. Given a0=-1 and a1=8 [7M]
OR
1 of 2
|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 3

8 a) Solve an-4an-1+4an-2=4n [7M]

b) Solve the following recurrence relation [7M]
an +6an-1+8an-2=0, n ≥ 2 , a0 =2, a1 = -7
UNIT-V
9 a) Explain the Prim's algorithm for finding Minimal Cost Spanning Tree with an [7M]
example.
b) Draw the binary tree for the sequence of numbers {2,1,5,6,8,9,7,3,4} [7M]

OR
10 a) What are the rules for constructing a Hamiltonian path and Hamiltonian cycle. [7M]
b) Let Cn be a Cycle graph with n vertices. Prove that C5 is the only cycle graph [7M]
isomorphic to its complement

2 of 2

|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 4

II B. Tech I Semester Regular/Supplementary Examinations, December-2023

MATHEMATCIAL FOUNDATIONS OF COMPUTER SCIENCE
(Com to CSE, CST,CSE(AI),CSE(AIML),AI,DS,CSE(AIDS),CSE(CS), CSE(DS), CSE(IOTCSBT),
CSBS,CSE(IOT),AIDS,AIML, CS(CSD))
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

UNIT-I
1 a) Obtain the principal disjunctive normal forms of the formula [7M]
P → (P Λ (Q → P))
b) Prove or disprove the validity of the following arguments [7M]
Some rational numbers are powers of 3.
All integers are rational numbers.
Therefore, some integers are powers of 3.
OR
2 a) Express P ↔ Q using ↓ only. [7M]
b) Prove that ∃x(P(x)∧S(x), ∀x(P(x)→R(x) ⇒∃x(R(x)∧S(x)) [7M]

UNIT-II
3 a) Let X = {1, 2, 3, 4, 5, 6, 7} and R= {(x,y)/ x-y is divisible by 3} in X. show that [7M]
R is an Equivalence Relation.
b) Draw Hasse diagram representing the partial ordering on {(a,b) : a | b} on [7M]
{1,2,3,4,6,12,24,36,48}.
OR
4 a) Let A be a set with n elements and P(A) is its power set. Show that cardinality of [7M]
P(A) is 2n
b) Determine whether the binary * defined as commutative and whether it is [7M]
associative on the set Z where a*b=a-b
UNIT-III
5 a) In how many ways can you select at least one king, if you choose five cards [7M]
from a Deck of 52 cards
b) Write short notes on following w.r.to number theory. [7M]
- divisibility theorem, GCD, Fundamental theorem of Arithmetic
OR
6 a) Define binomial theorem? What is the coefficient of x 101 y 99 in the expansion of [7M]
(2x-3y)200
b) In how many ways can 23 different books be given to 5 students so that 2 of the [7M]
students will have 4 books each and the other 3 will have 5 books each

1 of 2
|'''|'|'|''||'''||||
Code No: R2021054 R20 SET - 4

UNIT-IV
7 a) Solve the recurrence relation an - 7an-1 + 10an-2 =0 for n≥2 using generating [7M]
functions.
b) Solve the recurrence relation an2 - 2 an-12 =0 for n ≥ 1 where a0 = 2 [7M]

OR
n
8 a) Solve an-7an-1+10an-2=4 [7M]
b) Solve the recurrence relation an - 6an-1 + 12an-2 - 8an-3=0 for n≥3 [7M]

UNIT-V
9 a) Explain Depth First Search algorithm with the following graph [7M]

b) Prove that in any non directed graph there is an even number of vertices of odd [7M]
degree
OR
10 a) What is the chromatic number of the following [7M]
i) Cn ii) Kn iii) Km,n iv) tree with n vertices
b) Find whether K3,3 is planar or not. [7M]

2 of 2

|'''|'|'|''||'''||||