CBCS Scheme

Third Semester BE Degree Examination

Discrete Mathematics
Time: 3 Hours Max. Marks: 100
Note: Answer FIVE full questions, choosing one full question from each module.
Module – 1
1. a) Prove the following logical equivalence using laws of logic.
i) [{(pq) r}q] qr ii) [(pq) (pq)] q pq (07 Marks)

b) Test whether the following arguments are valid:

i) (pq)r ii) pr
r(st) rs
su ts
ut  tu
p u
p (07 Marks)
c) i) Test the validity of the following argument:
If Ravi goes out with friends, he will not study.
If Ravi does not study, his father becomes angry.
His father is not angry.
 Ravi has not gone out with friends ` (03 Marks)
ii) Prove the following using truth table with the aid of logical implication:

a) [p  (p q)]  q b) [(p q)  q] p c) [(p  q)  p]  q (03 Marks)
OR
2 a) Prove the following logical equivalence.
i) [p(qr)] (qr)(pr) r ii) [(pq) (pqr)]  pq (07 Marks)

b) Establish the validity of the following argument using the rules of inference:

{p  (p  q)  (s  r)  (r  q)}  (st) (07 Marks)

c) Let p(x): x2-7x+10=0, q(x):x2-2x-3=0, r(x):x<0, determine the truth or

falsity of the following statements when the universe U contains only the
integers 2 and 5. If a statement is false, provide a counter example or explanation.
i) vx, p(x) r(x) ii) vx, q(x) r(x)
iii) x, q(x) r(x) iv) x, p(x) r(x) (06 Marks)
Module – 2
3 a) Prove by mathematical induction that for every positive integer ‘n’, the number
An=5n+2.3n-1+1 is a multiple of 8. (05 Marks)

b) i) How many arrangements are there for all letters in the word SOCIOLOGICAL?
ii) In how many of these arrangements:
(a) A & G are adjacent. (b) All the vowels are adjacent. (05 Marks)

1
 c) In how many ways can 10 identical pencils be distributed among 5 children in
the following cases. i) There are no restrictions ii) Each child gets at least one pencil.
iii) The youngest child gets at least 2 pencils. (05 Marks)

d) Find the coefficient of

x9y3 in the expansion (2x-3y)12. (05 Marks)
OR
4.a) For the Fibonacci sequence F0, F1, F2 prove that
Fn= 1/√5[(1+√5/2)n-(1-√5/2)n]. (05 Marks)

b) A woman has 11 close relatives & she wishes to invite 5 of them to dinner.
In how many ways can she invite them in the following situations?
(i).There is no restriction on the choice.
(ii) Two particular persons will not attend separately.
(iii) Two particular persons will not attend together. (05 Marks)

c) In how many ways can we distribute 7 Apples and 6 Oranges among 4 children,
so that each child gets at least 1 Apple.

d) Find the coefficient of

a2b3c2d5 in the expansion of (a+2b-3c+2d+5)16. (05 Marks)
Module – 3
5 a) Let A={1,2,3,4,5,6} and B={6,7,8,9,10}. If a function f: AB is defined by,
f={(1,7),(2,7),(3,8),(4,6),(5,9),(6,9)} determine f -1(6) and f -1(9).
If B1= {7, 8} and B2= {8, 9, 10}, find f -1(B1) and f -1(B2). (07 Marks)

b) i) Let f and g be the functions from R to R defined by f(x)= ax+b and g(x)= cx+d.
What relationship must be satisfied by a,b,c,d if gof=fog?
ii) Let f and g be the functions from R to R definrd by f(x)=ax+b and g(x)=1-x+x2.
If (gof)(x) = 9x2-9x+3, determine a,b. (07 Marks)

c) i) Prove that if 30 dictionaries in a library contain a total of 61,327 pages,

then at least one of the dictionaries must have at least 2045 pages.
ii) If 5 colours are used to paint 26 doors, prove that at least 6 doors will have the same
colour. (06 Marks)
OR
6.a) let f: R→R be defined by

f(x)= 3x-5 for x>0

-3x+1 for x ≤ 0

i) Determine f(0),f(-1),f(5/3),f(-5/3).
ii) Find f-1(0), f-1(-1), f-1(3), f-1(-3), f-1(-6).
iii) What are f-1([-5,5]) and f-1([-6,5]) (07 Marks)
b) Consider the functions f and g defined by f(x) =x3 and g(x) =x2+1, vx Є R.
Find gof, fog, f2 and g2. (06 Marks)

2
 c) Let A= {1,2,3,4} and B={1,2,3,4,5,6}.
i) Find how many functions are there from A to B. How many of these are
one-to- one? How many are onto?
ii) Find how many functions are there from B to A. How many of these are
one-to-one? How many are onto? (07 Marks)
Module – 4
7 a) Let A={1,2,3,4,6,12} on A, define the relation R by aRb if and only if a divides b.
i) Prove that R is a partial order on A.
ii) Draw the Hasse diagram.
iii) Write down the matrix of relation. (07 Marks)

b) Find the number of permutations of the letters a,b,c,….x,y,z in which none of the patterns
spin, game, path or net occurs. (07 Marks)

c) Describe the expansion formula for rook polynomials. Find the rook polynomial for 3X3
board using the expansion formula. (06 Marks)
OR
8 a) Consider the Hasse diagram of a poset (A,R) given below.

If B={c,d,e}, find : i) All upper bounds of B ii) All lower bounds of B

iii) The least upper bound of B iv) The greatest lower bound of B (06 Marks)

b) In how many ways can the integers 1,2,3,….,10 be arranged in a line so that
no even integer is in its natural place. (07 Marks)

c) An Apple, a banana, a mango, and an orange are to be distributed to 4 boys B1, B2,
B3, B4. The boys B1 and B2 do not wish to have apple, the boy b3 does not want
banana or mango, and b4 refuses orange. In how many ways the distribution can be
made so that no boy is displeased. (07 Marks)
Module – 5
9 a) Define the following with examples:
i) Simple Graph ii) Complete Graph iii) Regular Graph iv) Bipartite Graph
v) Hand Shaking Property. (06 Marks)

b) i) If G=(V,E) is a simple graph prove that 2|E|≤|V|2-|V|.

ii) Show that a complete graph with n vertices, namely K n ,has 1/2n(n-1) edges.
(07 Marks)
c) Obtain an optimal prefix code for the message “MESSAGE RECIEVED”.
Indicate the code. (07 Marks)

3
 OR
10.a). Determine the order |V| of the graph G=(V,E) in
i) G is cubic graph with 9 edges
ii) G is regular with 15 edges
iii) G has 10 edges with 2 vertices of degree 4 and all other vertices of degree 3.
(06 Marks)
b) Prove that in a graph
i) The sum of degrees of all the vertices is an even number and is equal to
twice the number of edges in the graph.
ii) The number of vertices of odd degree is even.
iii) Show that a tree with ‘n’ vertices has n-1 edges. (07 Marks)

c) Define optimal tree and construct an optimal tree for a given set
of Weights {4,15,25,5,8,16}. Hence find the weight of the optimal tree. (07 Marks)