MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE

(Common to CSE and IT)

Time: 3Hours Max. Marks: 70M
PART-A
Answer ALL Questions
1. Answer in ONE sentence 5x1=5M

a) What is molecular statement?

b) Define a poset.
c) State the formula for principle of inclusion and exclusion for two sets.
d) Define a generating function.
e) What is chromatic number?

2. Answer the following very briefly. 5x2=10M

a) Write the negation of the statement for the following formula.

(∃x)(∀y)p(x,y).
b) A={1,2,3 }and B={ x , y , z } and consider the relation R={(1 , y ),(1 , z),(3 , y )}. Find the
domain and range of R.
c) Let A and B be finite sets with | A|=n∧|B|=m, then find the number of all functions from A
into B.
d) Find the generating function for the sequence 1, 3, 3, 1, 0, 0, 0, 0…
e) Define a bipartite graph.

3. Answer the following briefly. 5x3=15M

a) Construct the truth table for the formula P ⟶ ( ¬ P→ Q )

b) Let A = {1, 2, 3, 4}, B = {a, b, c, d}, C = {x, y, z} and let R = {(1, a), (2, d), (3, a), (3, b), (3, d)}
and S = {(b, x), (b, z), (c, y), (d, z)} then compute R ∘ S.
c) How many different words can be formed by rearranging the letters of the word
LALITHAKAMALAM?
d) Write a solution of recurrence relation F n=F n−1+ F n−2 with n ≥ 2 where F 0=0∧F1=1
e) Suppose the graph K(m,12) has 72 edges then find the value of m.

Page 1 of 2
 PART-B
Answer any FOUR questions 4X10=40M

4. a) Construct the truth tables for the following formulas.

i) ¬ (P ⋁ (¬P∧Q)) ⟺¬P∧¬Q
ii) ( P →Q ) ( P ⋀ ¬ Q)
b) Write the following statements in the symbolic form.
i) If I am hungry and thirsty, then I am hungry
ii) If I am hungry or thirsty, then I am hungry

5. a) Verify the relation R={(1,1)(1,4)( 4,1)(2,2)(2,3)(3,4)(3 , 3)(3,2)( 4,3)(4,4)} on

X ={1,2,3,4 }is equivalence relation or not?
b)Prove that the set of all n, nth roots of unity forms a finite abelian group of order
n w.r.t multiplication.
6. a) How many ways are there to distribute five cards to each of 4 players from a standard deck
of 52 cards?
10
b) Find the coefficient of x 16in ( 1+ x 4 + x 8 ) .

7. a) Solve the recurrence relation un −7 un−1+ 12un −2 =0for n ≥ 2 ,u0 =1∧u1=2.

1
b) Solve the recurrence relation a n+2−an+1−12 a n=10 , a1= ,a 0=0 .
3

8. Prove that a complete bipartite graph k m ,n is planar. If ≤ 2∨n ≤ 2

9. Prove or disprove that the following two graphs are isomorphic?

****

Page 2 of 2