478

B. E. (Computer Engg.) BIrd Semester (New Scheme),

Examination December-20H2

D~CRETESTRUCTURES
Paper-CSE-20 l-C
Time allowrd : 3 hours !l1axi1l1l1l1l Murks : J 00

Note: Attempt five quesrions in all with at least olle questioll from
each unit. All questions carry eql/ollllarks.

Unit-I

1. (a) let A, B, C be arbitrary sets.

(i) Show that (A _. B) - C = A - (B u C). (ii)

Show that (A - B) - C = (A - C) - B.

(iii) Show that (A - B) - C = (A - C) - (B - C).

(b) Prove by induction that forn >= I

( 1.1! +2.2! + 3.3! + ..... + n.n! (n + 1)1 -I. where
=
:.\
J; n! stands for the product 1.2.3 .... 11.

C;) Show that 2" x 2" - I is divisible by .3 for all

n >= 1 by induction. 10+ 10

2. Let R he a binary relation on the set of all positive integers such

that R = {(a, b) I a - b is an odd positive integer}

Is R reflexive? Symmetric? Antisymmetric? Transitive? A partial
ordering relation? An equivalence relation? 20

., : JIIIJ " [DL*: .. ,.JJJI •. ~ LJlJ: ." .. ' r

 Unit-II (b) What is an Abelian group? Show that:
3. (i) The inverse of the product of two elements of a
4. Solve the following recurrence relations:
r
group G is the product of the inverse taken in the
(a) a, - 7 a'_1 + 10 ar_2 = 3 given that a = 0 and a, = 1 o
reverse order.
(b) a, + ar_1 + a'_2 = 0 given that a = 0 and a! == 2. 10+10 o m
(ii) If G is a group such that (ab)m = am b for three
consecutive integers m for all a, b belongs to G,
4. Detennine the particular solution for the following difference
show that G is Abelian. 10+10
equations:
Unit-IV
(a) ar - 2 ar_1 = f (r) where f (r) = 7 r (b)lIr
10+10 7. (a) Prove that a finite connected graph G is Eulerian if and
- 2 ar_1 = f (r) where f (r) = 7 r2.
only if each vertex has even degree.
Unit-III
(b) Let G be a graph with more than one vertex. Prove the
5. (a) What do you understand by "The group of integers modulo under following are equivalern :
addition"? Find the inverse of each element in Z4' the group (i) G is a tree.
of integers modulo 4 under addition (ii) Each pair of vertices is connected by exactly one
simple path.
(b) Which of the following are groups? GiV<' reasons also: (i) M,., (iii) G is connected; but G- e is disconnected for any

(R) with matrix addition (;dge e of G.

(iv) J is cycle--free, but if any edge is added to G then
(ii) M2 x 2 (R), with matrix multiplicatiun
10+10 the resulting graph has exactly one cyde. 10+10
(iii) {-I, I} with multiplication.
8. (a) Draw the final tree T if the following numbers are
6. (a) Deline permutation group and scmigroup. What do you understand
inse:ted into an empty binary search tree:
by even and odd permutati()!1s? How many are the total
T: .'0, 33, 44, 22. 77, 35, 60, 40.
permutation of degree n and how many of them are even and
odd permutations? Give the proof also. (b) Suppose a Graph G contains two distinct paths from a
vertex u to a vertex v. Show that G has a cycle. 10+ 1 0

;;J:'<':'"~::'~,~';>-:'''l:~-''7"7· ~_--",~""""",:"-"c:~_,,._ - .••.• ~:'. ~,..,-o,~..-.-<->+o .~< ,,,.~-,,,,,,,,,,.,,,,,,-. 478-2.200

··:-"'~~·:~7-,"'_.:\"f~_·.-.,...-""':~,,._~_~~~
~'~'--'" .•••..•••. ' .• , ..... "'.~- ..•. ~_ .•••• _._,,:"'J .. ,.,.,.~.~ _ ~.:- .•.. ">tflIl:ro;;...<, ._..,z:l"' ••.. ~~"".~.--
~:~"l~'I!:[';~, •••• ".!lI !!I_."'_Il\II!! •• _.II!!I •.••••• "l~ •• "". ;;-. ,-
..,.~ -""'!":·E;~~ •••• '