Scribd
Upload
15 views

Mathematical Foundations of Computer Science Sept 2021

Uploaded by

ksuchitha2002
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

Mathematical Foundations of Computer Science Sept 2021

Uploaded by

ksuchitha2002
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: R1921051 R19 SET - 1

II B. Tech I Semester Supplementary Examinations, September - 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) Prove that [(Pꓥ⌐Q)→R]→[P→(QꓦR)] is a tautology using a truth table. [8M]


b) Explain the law of duality with a case study. [7M]

Or
2 a) Define free and bound variables and explain the theory of predicate calculus. [8M]
b) Show that (∃x)[F(x)ꓥS(x)]→(y)[M(y)→W(y)] and (∃y)[M(y)ꓥ⌐W(y)] derives [7M]
the Conclusion, (x)[F(x)→⌐S(x)].
3 a) Find the transitive closure for the R={(1,2),(2,3),(3,4)}on X={1,2,3,4} [8M]
b) Demonstrate equivalence relation with a case study. [7M]

Or
4 a) Discuss the similarities and dissimilarities between monoid and group. [8M]
b) Draw the Hasse diagram for the relation ≤ defined as x≤y, if x divided y where [7M]
X={2,3,6,12,24,36}
5 a) State and Prove Fermat’s theorem. [8M]
b) How many ten digit binary numbers can be formed with (i) exactly five 1’s (ii) [7M]
greater than five 1’s.
Or
6 a) Discuss the properties of modular arithmetic with examples. [8M]
b) Explain the binomial theorem with an example. [7M]
7 a) Calculate the coefficient of X15 in [8M]
A(X)=(X2+X3+X4+X5)(X+X2+X3+X4+X5+X6+X7)(1+X+….+X15)
b) Solve the recurrence relation an-9an-1+26n-2-24an-3=0 for n≥3 using characteristic [7M]
polynomial representation.
Or
8 a) Find the Coefficient of X23and X32 in (1+X5+X9)10 [8M]
b) Discuss the importance of methods to solve a recurrence relation. [7M]
9 a) Trace the BFS algorithm with a case study. [8M]
b) Define a minimum spanning tree and write a procedure to identify a minimum [7M]
spanning tree for an example graph.
Or
10 a) Discuss the similarities and dissimilarities between Eulerian and Hamiltonian [8M]
graphs.
b) Define the following terms in graph theory(i) path (ii) cycle (iii) loop [7M]
1 of 1
|''|''|||''|'''|||'|

You might also like