Code No: R7210502 R7

II B.Tech I Semester(R07) Supplementary Examinations, November 2010

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
(Common to Computer Science & Engineering, Information Technology and Computer
Science & Systems Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Construct the truth table of the proposition: A ⊕ B ⊕ C

(b) Show that the proposition: (P → Q) ↔ ( ∼ Q →∼ P) is a tautology.
(c) What is the compound statement that is true when none, or one, or two of the three statements
P, Q and R are true? [4+6+6]
2. (a) Using propositional logic, prove the validity of the following argument:
P ∨ Q, Q → R, P → M, ∼ M ⇒ R ∧ (P ∨ Q)
(b) Determine the validity of the following arguments using propositional logic:
“If two sides of a triangle are equal, then the opposite angles are equal. T wo sides of a
triangle are not equal. T heref ore, the opposite angles are not equal”. [8+8]
3. (a) Find the inverse of the following functions:
10
i. f(x) = √5
7−3x
ii. f(x) = 4e(6x+2) .
(b) Draw the Hasse diagram for the relation R on A = {1, 2, 3, 4, 5}, whose relation matrix is given
below: [8+8]
 
 1 0 1 1 1 

 
 0 1 1 1 1  
MR = 0 0 1 1 1

 

 0 0 0 1 0 
 
0 0 0 0 1

4. (a) What is a group? What are properties of a group? Explain them with an example each.
(b) Show that any group G is abelian iff (ab)2 = a2 b2 for all a, b ∈ G. [8+8]
5. (a) Find the number of permutations of the letters of TOMANDJERRY so that same letters do not
appear together.
(b) Find the 7 - card hands that have at least one card in each suit. [8+8]
6. Find the characteristic roots of the linear homogeneous recurrence relation
an = 2 an−1 - 2 an−2 and find the solution of the recurrence relation with a0 =1, a1 = 2. [16]
7. (a) Let H be a connected graph G. Show that H is a sub graph of some spanning Tree T of G if H
contain no cycles.
(b) Prove that if graph G is a tree if and only if G has no cycles. [8+8]
8. (a) Show that two simple graphs are isomorphic if and only if their complements are isomorphic.
(b) Let G be a simple graph all of whose vertices have degree 3 and |E| =2 |V| -3. What can be said
about G? [8+8]

?????