USN

10cs42
(06 Marks)
(05 Marks)
(05 Marks)
(05 Marks)
(05 Marks)
(06 Marks)
Fourth Semester B.E. Degree Examination, Dec. 20l3lJan.2014
Graph Theory and Gombinatorics
Note: Answer FIYE
full
questions, selecting
atleast TWO questions
from
each part.
rlt:\
Max. Marks:,,,100,:'
d
2a.
b.
c.
o
o
o
()
(f
oX
bo*
6(r)
on
li
troo
.= c\
(B r{'
69!
otr
FO
o>
3z
a=
OO
botr
a6
5s
p-
6-
o'e
o;
o=
6E
LO
5.Y
>'
(r
c50
o=
90
tr>
o
U<
-
e.l
()
z
L
o
DANT
PART
_
A
la.Prgvethatineverygraph,thenumberofverticesofodddegreeiseven.
b. Show'-1hat a simple graph of order n: 4 and size m
:7
and a completograph of order n:4
and sizem= 5 do not exist. " ',,,,, (04 Marks)
c. Define isomorphism of two graphs. Show that the two graphs given below are isomorphic.
(05 Marks)
1:
Show that in a complete graph,with"n' veriices where n is an odd number and n
)
3, there
'
,'
. Fie,
Ql(c)
Discuss Konigsberg bridge problem ana tfreisoiution of the problem.
Show that Kuratowski's first graph, Ks is non
-
planar.
n-l
are
-edge
disjont HamiJtoa cycles. ,,
,
'.,'
2
Define dual of a planargr,4ph. Draw the geometric dual of the given graph.
d
Definb,ehromatic number. Find P(G, ),) for the Fig.
Q2(d).
.......
3 a. Define a tree. Prove that the tree with P vertices has P
-
1 edges.
b. 'Find allthe spanning trees of the graph shown below :
_n:
Fig.
Q3(b)
(04 Marks)
c. Construct an optimal prefix code for the symbols A, B, C, D, E, F, G, H, I, J that occur
with respective frequencies 78, 16, 30, 35,125,31,20,50, 80, 3. (06 Marks)
d. If a tree T has four vertices of degree 2, one vertex of degree 3, two vertices of degree 4 and
Fig.
Q2(c)
Fis.
Q2(d)
t*
..v
wv
one vertex of degree 5, find the number of leaves in T. (04 Marks)
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m
4a.
b.
10cs42
Define i) cut set
,
ii) edge connectivity
,
iii) bridge connectivity
,
iv) matching with
examples. (04 Marks)
Apply Dijkstra's algorithm to the following weighted graph shown in below Fig.
Q4(b)
and
determine the shortest distance from vertex 'a' to each of the other six vertices in the graph.
'
"''
le.:
d
FiS.
Qa(c).
.j*
(05 Marks)
Foi'fhe network shown in Fig.
Q4(d),
hnd the capacities of all the cutrsets between the
vertiCo*epand d and hence deiermine the maximuY"Y"weena
mU.
(05 Marks)
::,,,::
":'
'"""""'::,
Fig.
Qa(d)
.. .;
,,1. t."
ti
+z
PART
_
B'.....
5 a. A woman has 1 1 close ,elatlVe, ,ra ,n. *irU*, to invite 5 of them to diner. In how many
ways can she invite them in the following situations :
i) There are no restrictions on the choice
ii) Two particular persons will not attend separately
iii) Two particular persons will not attertd together.
Find the co-efficient of xI yo ,'in the expansion of (2x3
-
3*l + ,')u.
Define Catalan numbers. Ugi the moves : R(x,
il
-+ (x r 1, y) and U(x, y) ) (x, y + 1)
find in how many ways ca-n one go from : iX0, 0)d'"(6,6) and not rise above the line y
:
x
11) (2,l)to (7,6) and no-trise above the line y: x
-
I..,.,,,,:..,.,: (07 Marks)
ln how many ways can the 26letters of the English alphabet be permitted so that none olthe
patterns CAR,
DQG,
PIIN or BYTE occurs?
.
(07 Marks)
For the posj{ive integers 1, 2,3, . n there are 11660 derangements where 1,2,3, 4, 5
appear inthefrrst five positions. What is the value of n? (06 Marks)
Four pe*ons Pr, Pz, P3, Pa who arrive late for a dinner party find that oniy one chair at each
of five tables Tr, Tz, T:, T+ and T5 in vacant. Pr will not sit at Tr or Tz,Pz will not sit at T2,
P:'w111 not sit at T: or T+ and P+ will not sit at Ta or Ts. Find the number of ways they can
(06 Marks)
(07 Marks) b.
c.
6a.
b.
c.
i. tli
la.
.. b.
c.
8a.
b.
c.
,,,occupy the vacant chairs.
,(07
Marks)
Find the generating function for the sequence 0,2,6, 12,20,30, 42, (07 Martrs;
lnhow many ways can 12 oranges-be distributed among three children A, B, C so that A
gets at least four, B and C get out least two, but C gets no more than five? (06 Marks)
Define exponential generating functions. Find the exponential generating function for the
number of ways to arrange n letters selected from MISSISSIPPI. (07 Marks)
Find the recurrence relation and the initial condition for the sequence 2, 10,50, 250, .......
Hence find the general term of the sequence. (06 Marks)
Solvetherecurrencerelation&rfon-l-6an-z:0forn>2giventhatao:-1 and&r:8.
(07 Marks)
Using the generating function solve the recurrence relation an- 3an-1
:
fl, fl
>
1 given ao
:
1.
(07 Marks)
*rt<{<**
For More Question Papers Visit - www.pediawikiblog.com
For More Question Papers Visit - www.pediawikiblog.com
w
w
w
.
p
e
d
i
a
w
i
k
i
b
l
o
g
.
c
o
m