Code No: R1921051 R19 SET - 1

II B. Tech I Semester Regular Examinations, March - 2021

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science &Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1 a) Obtain the Principal disjunctive normal form of (P→Q) ˄ (Q↔R) 8M
b) Show that RΛ(P VQ) is a valid conclusion from the premises PVQ, Q→R, P→M 7M
and ¬M.
Or
2 a) Obtain the Principal conjunctive normal form of (P˄Q)˅(~P˅Q˅R) 8M
b) Show that ( ∃x) ( P (x) Λ Q ( x ) ) ⇒ ( ∃x) P (x) Λ ( ∃x) Q ( x ) 7M
3 a) Define Relation? List out the Properties of Binary operations? 7M
b) Let the Relation R be R={(1,2) ,(2,3),(3,3)} on the set A= {1,2,3}. What is the 8M
Transitive Closure of R?
Or
4 a) Prove that (S,≤) is a Lattice, where S= {1,2,3,6} and ≤ is for divisibility. Prove that 15M
it is also a Distributive Lattice?
b)
5 a) Write the 3-combinations and 3-permutations of {3.a, 2.b, 1.c, 3.d}. 7M
b) In how many ways can a committee of 5 teachers and 4 students be selected from 8M
9 teachers and 15 students such that teacher A refuses if student B is in the
committee.
Or
6 a) Expand the multinomial (X1+X2+X3+X4)4. 7M
b) Find the number of non negative integral solution for the equation 8M
X1+X2+X3+X4=50, where X1>= 2, X2>= 4, X3 >= -3, X4>= 7.
7 a) Solve the recurrence relation. un-2un-1-2un-2=5n, n ≥2, u0= 1, u1 = 1 8M
b) Explain in brief about Partial fractions? 7M
Or
8 a) Solve an=an-1 + n where a0 =2 by substitution? 7M
b) Find a particular solution for recurrence relation using the method of determined 8M
coefficients an- 5 an-1=3^n ?
9 a) Let G be the non directed graph of order 9 such that each vertex has degree 5 or 6. 8M
Prove that atleast 5 vertices have degree 6 or atleast 6 vertices have degree 5.
b) Determine the number of edges in: 7M
i) Kn ii) Km,n iii) Pn.
Or
10 a) What is a Hamiltonian Cycle? Draw bipartite graph K3,4 and prove that this graph 10M
does not have a Hamiltonian cycle.
b) Prove that a simple graph with n vertices and k components can have at most 5M
(n - k)(n – k + 1) edges.
1 of 1

||''|''||''||''''''|
Code No: R1921051 R19 SET - 2

II B. Tech I Semester Regular Examinations, March - 2021

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

1 a) Explain the term tautology? Show that [(p→q)→r]→[(p→q)→(p→r)] is tautology ? 8M

b) State the inverse for the statement “If a triangle is not isosceles, then it is not 7M
equilateral”.
Or
2 a) Derive the following using CP rule if necessary 8M
P → (Q→R) , Q → (R→S ) ⇒ P → ( Q→ S)
b) What is mean by contradiction? Explain it with an example. 7M
3 a) Let A ={a, b, c} be a set and relation R on A is as = {(a, a)(a, b)(b, c)(c, c)}. Is R. 8M
i) Reflexive ii) Symmetric iii)Transitive.
b) Prove that the intersection of any two subgroups of a group G is again subgroup of 7M
G.
Or
4 a) In a lattice (L, ≤ , ∧, ˅) state and prove the laws indempotent, commutative, 7M
association and absorption.
b) If R and S are equivalence relations on a set A. Prove that R∩ S is an equivalence 8M
Relation.
5 a) Find the number of integers between 1 and 250 that are divisible by any of the 8M
integers 2, 3 and 6.
b) Find the coefficient of x9y3 in the expansion of (2x - 3y)12. 7M
Or
6 a) How many bit strings of length 10 contain: 7M
i) At most four 1’s ii) At least four 1’s iii) Exactly four 1’s
b) There are 40 computer programmers for a job. 25 know Java, 28 know Oracle and 7 8M
know neither language. Using principle of inclusion exclusion find how many know
both languages.
7 a) Find the number of integer solutions of the equation x1 + x2 + x3 + x4 + x5 = 30 8M
Under the constraints xi ≥ 0 for all i = 1, 2, 3, 4, 5 and further x2 is even and x3 is
odd.
b) Solve the recurrence relation an-6an-1+ 9an-2= 0 for n ≥ 2. 7M
Or
8 a) Solve the recurrence relation T(n) = 4T(n -1) + 2n , with T(0) = 6 . 8M
b) What is a Generating function and explain the operations on generating 7M
functions?
9 a) Show that a simple complete digraph with n nodes has the maximum number of 8M
Edges n (n-1). Assuming that there are no loops.
b) State and explain graph coloring problem. Give its applications. 7M
Or
10 a) Show that the complete bi-partite graph K3, 3 is not planar graph. 7M
b) Write short notes on DFS and BFS. 8M
1 of 1

||''|''||''||''''''|
Code No: R1921051 R19 SET - 3

II B. Tech I Semester Regular Examinations, March - 2021

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

1 a) Define Well Formed Formula? Explain about Tautology with example? 8M

b) Without constructing the Truth Table prove that (p→q)→q=pvq? 7M
Or
2 a) Obtain the Principal conjunctive normal form of (P→Q) ˄ (Q↔R) 7M
b) Show that S V R is tautologically implied by (P V Q) Λ (P → R) Λ (Q → S) 8M
using Automatic Theorem Proving?
3 a) Explain properties of binary relations with examples. 7M
b) Draw the Hasse diagram for the partial ordering {(A, B): A ≤ B} on the power 8M
set e(S) where S={a, b, c} and ≤ is subset relation
Or
4 a) Draw the Hasse diagram for the divisibility on the set 8M
{1,2,3,6,12,24,36,48,96}.
b) Define equivalence relation. Show that the relation equal on set of integers is 7M
equivalence relation.
5 a) Write the 3-combinations and 3-permutations of {3.a, 2.b, 1.c, 3.d}. 7M
b) There are 35 students and 04 teachers. In how many ways every student shakes 8M
hand with other students and all the teachers.
Or
6 a) How many different five digit numbers can be formed from the digits 0,1,2,3 7M
and 4?
b) In how many ways can 23 different books be given to 5 students so that 2 of 8M
the
students will have 4 books each and the other 3 will have 5 books each?
7 a) Let A={1, 2,3 ,4} and f and g be functions from A to A given by f={(1,4), 8M
(2,1), (3,2),(4,3)} and g={ (1,2), (2,3), (3,4), (4,1)} prove that f and g are
inverse of each other
b) Explain Generating function and explain various operation on generating 7M
Function.
Or
8 a) Solve the recurrence relation. un-2un-1-2un-2=5n, n ≥2, u0= 1, u1 = 1 7M
b) Find the particular solution of the recurrence relation an+2 – 4 an+1 + 4 an = 2n? 8M
9 a) In any planar graph, show that |V|–|E|+R|=2. 7M
b) Prove that complete graph of 5 vertices is non planar. 8M
Or
10 a) Write an algorithm for breadth-first search spanning tree. 8M
b) Write Kruskal‟s Algorithm and explain it with an example. 7M
1 of 1

||''|''||''||''''''|
Code No: R1921051 R19 SET - 4

II B. Tech I Semester Regular Examinations, March - 2021

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Computer Science & Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

1 a) Define tautology. Show that [(p ˅ q) ˄ (p → r) ˄ (q → r)] → r is a tautology, by 8M

constructing a truth table.
b) Prove the following logical equivalence without using truth table. 7M
(p → q) ˄ [˥q ˄ (r ˅ ˥q)] <=>˥(q ˅ p)
Or
2 a) a)Prove that 8M
i) ~ (P↑Q)↔ ~P↓~ Q
ii) ~ (P↓Q)↔ ~P↑~ Q Without using truth table?
b) Write conditional proposition and logical equivalence with suitable examples. 7M
3 a) If R and S are equivalence relations on a set A. Prove that R∩ S is an 7M
equivalence Relation.
b) Let B = { a, b, c} and A = P (B) be the power set of B. Draw the Hasse diagram 8M
for⊆and poset A.
Or
4 a) Prove that every subgroup of a cyclic group is cyclic. 7M
b) In any group (G,*), by proving the inverse of every element is unique. Show that 8M
(a*b)-1 = b-1* a-1, ∀a bϵG.
5 a) Compare and contrast Euler and Hamiltonian graphs using examples? 8M
b) What is the coefficient of x3y7 in (x+y)10 ? 7M

Or
6 a) Find the number of integers between 1 and 250 that are divisible by any of the 8M
integers 2,3 and 6.
b) Find the coefficient of x9y3 in the expansion of (2x - 3y)12. 7M
7 a) Solve an + 2n an-1 - 3n(n-1)an-2 =0 . 7M
b) Solve the recurrence relation an - 8 an-1 + 21 an-2 - 18 an-3 =0 for n ≥ 3 using 8M
generating functions?
Or
8 a) Solve the recurrence relation T(n) = 4T(n -1) + 2n , with T(0) = 6 . 8M
b) Explain in brief about Partial fractions? 7M

1 of 2

||''|''||''||''''''|
Code No: R1921051 R19 SET - 4

9 a) Write short notes on DFS and BFS. 8M

b) Construct the minimal cost spanning tree for the cities shown in above graph 7M
using krushkals algorithm?

Or
10 a) State and explain graph coloring problem. Give its applications. 7M
b) Construct the minimal cost spanning tree for the cities shown in above graph 8M
using Prim’s algorithm?

2 of 2

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