~SIB.

Tech/CSE/Odd/Sem-5th/CS_503/20 14-15

CS-503
DISCRETE MATHEMATICS

om
ime Allotted: 3 Hours
Full Marks: 70
The questions are of equal value.

.c
Thefigures in the margin indicatefull marks.
Candidates are required to give their answers in their own words asfar as practicable.

GROUP A
(Multiple Choice Type Questions)
da
ve
Answer any ten questions.
IOx1=1O
(i) Th e nurnern,
· sequence 0 f th e . functron
generatmg . _Z5 + 1 IS
.
m

z+1
(A) 1,-1, 1,-1
(B) 1 - 1 + 1 - 1 + 1 '"
xa

(C) 1, 1, 1, 1
(D) none of these
.e

(ii) A tree has 21 vertices, then X( G) is

(A) 20
(B) 10
(C) 40
w

(D) none of these

w

ii) The chromatic polynomial of Peterson graph is

(A) 3
w

(B) 4
(C) 5
(D) none of these

,r) The number of ways that a tree with 5 vertices can be coloured by 4 colours is
(A) 324
(B) 350
(C) 20
(D) none of these

[Tum over]
 Y" 4¥1',."
de· , m .'

CS/B. Tech/CSEiOdd/Sem-5th/CS_503/20 14-15

(v) The propositionp /\ (q 1\ ~ q) is a

(A) contradiction (B) tautology
(C) both (A) and (B)
(D) none of these
(vi) A 1\ B is equivalent to
(A)-A~-B
(B)-A ~B
(C) ~B ~A
(D) -(A ~ ~B)

om
(vii) (S,:S;) is a poset if and only if
(A) "<" is reflexive, antisymmetric and transitive
(B) ":S;" is reflexive, symmetric and transitive

.c
(C) "s," is reflexive and transitive
(D) ":S;" is antisymmetric and transitive

(viii) Every non-empty subset of N contains a

(A) maximal element
da
ve
(B) minimal element
(C) least element
(D) greatest element
(ix) If k is a positive integer, gcd(ka, kb) =
m

(A) k· gcd(ka, b)
(B) k- gcd(a, b)
(C) k· gcd(a, kb)
xa

(D) none of these

, a b
(x) If gcd(a, b) == d, then -, - are
d d
.e

(A) relatively prime (B) prime

(C) composite
w

(D) both (A) and (B)

(xi) In the Lattice {I, 5, 25, 125} W.r.t to the order relation "divisibility" the
w

complement of I is
(A) 1
w

(B) 5
(C) 25
(D) 125

(xii) The solution of the recurrence relation an = 2an_1 + 1with ao == 0 is

(A) 1- 211
(C) 211--1 - 1

5202
2
CSIB. Tech/CSE/Odd/Sem-5th/CS-503/20 14-15

GROUPB
(Short Answer Type Questions)

Answer any three questions. 3x5 = 15

2. Solve the difference equation J'n+4 - J'n = 2n.

om
3. Consider f'-J , the set of all natural numbers and a relation "<" defined on N by
a :::;b holds if and only if alb, '1a, hEN. Then show that ( N, :::;)is a poset.

4. In an area the custom is that girls give their choice to whom they will marry. One

.c
such choice is given below. Give your decision for matching and decide whether
each girl will be married within their choice.

5. Find whether the argument p ~ ~q, r ~ q, r

da
gl ~ (b, b-; hs), g2 ~ (hi, bi, h4), g3 ~ (h3, bs, bs), g4 ~ (b]., h-", hs), gs ~ (h2, h3, h4)

1= ~ p is valid or not.
ve
6. Prove that the product of any m consecutive integers is divisible by m.
m
xa

GROUpe
(Long Answer Type Questions)
.e

Answer any three questions. 3 x 15 = 45

w

7. (a) If S= {1.2,3} then draw the Hasse diagram of the poset Clo(S), ~), where p(S) is 5
the power set of S.
w

(b) Using the laws of propositional logic show that 1 = (p 1\ q) ~ (p v q). 5

w

(c) Using generating function solve the difference equation Yn+2 - 5Yn+l + 6Yn =0 5
when yo = 1,Yl = O.

8. (a) Show that every bipartite graph is 2 chromatic. 5

(b) Find integers u and v satisfying gcd(272, 119) = 272u + ll9v. 5

5202 [Turn over]

-Y·.
 "
U 187· Hi..

CSIB. TeCh/CSE/Odd/Sem-5th/CS_503/2014_15

(c) Show that the poset given in the following Hasse diagram IS a lattice. Is it
distributive and complemented?

dffie
5

aWb o

om
9. (a) In an under graduate Science college olfering a course in which every student will
have to take English and one of the following groups (Botany, Zoology, 5
Microbiology), (Botany, Chemistry and Zoology), (Physics, Zoology and Botany),
(Maths, Physics, Chemistry), (Maths, Physics, Statistics), (Maths, Statistics,

.c
Computer), (Computer, Chemistry, Microbiology).

Findhindrance.
the period allocation in a day such that students can attend their class without
any

(b) Show that number of primes is infinite.

(c) Ifgcd(a,b)== 1,showthatgcd(a+b,a2_ab+b2)==
da 5
,
i
ve
1 or3.
5
O.(a) State principle of inclusion and exclusion and use it to find the total number of
m

integers between I and 1000 which are neither perfect squares nor perfect cubes. 1+4
J
(h) State. decomposition theorem for obtaining chromatic polynomial and find the
xa

chromatic polynomial of the following graph using it. 1+4

.e
w

(c) Show that (p ~ q) 1\ (q ~ r) ~ (p ~ r) is a tautology.

w

5
(a) Cq is a cycle (i.e. a circular chain) with the nine vertices a, b, c, d, e,f, g, h, i. How
w

many distinct maximal matchings of size 4 in Cq contain the edge ab ? 5

b) Prove that (19io == I (mod 181).
5
c) Find r the closed form of the generating function for numeric function
•fr == -2 (r + I),r > a . 5