Scribd
Upload
170 views3 pages

Graph Teory

This document contains a model question paper for the fourth semester B.E degree examination in Graph Theory and Combinatorics. It includes 8 questions divided into two parts - Part A and Part B. Students must answer any 5 full questions, selecting at least 2 questions from each part. The questions cover a range of topics including graph theory, trees, coding, sorting algorithms, planar graphs, network flows, permutations, combinations, and generating functions.

Uploaded by

Vijaykumar Chiniwar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
170 views3 pages

Graph Teory

This document contains a model question paper for the fourth semester B.E degree examination in Graph Theory and Combinatorics. It includes 8 questions divided into two parts - Part A and Part B. Students must answer any 5 full questions, selecting at least 2 questions from each part. The questions cover a range of topics including graph theory, trees, coding, sorting algorithms, planar graphs, network flows, permutations, combinations, and generating functions.

Uploaded by

Vijaykumar Chiniwar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Fourth Semester B.

E Degree Examination
(Common to CS and IS)
Model Question Paper

06CS42 Graph Theory & Combinatorics


Note: Answer any FIVE Full questions, selecting at least TWO Questions from
each PART

Time: 3 Hours Maximum marks : 100


PART A
1a) Define Isomorphism of graphs. Show that the following graphs are isomorphic (6)

Fig 1a
b) Show that a graph has even number of odd vertices (6)
c) Define the following terms with examples (8)
i) Circuit ii) Path iii) Directed Graphs iv) Sub graph

2 a) Define a planar graph. Show that K5 is not a planar graph (6)


b) Show that in any connected planar graph with n vertices, e edges and f faces
e-n+2=f (Euler’s Formula) (7)
c) i) What is Hamilton cycle?
ii) For n€Z+ , n=2 show that the number of distinct Hamilton cycles in the graph
Kn, n is ½(n-1)!n!
iii) How many different Hamilton’s paths are there for Kn,n and n=1?
(1+3+3 = 7)
3 a) Show that a Tree with ‘n’ vertices has n-1 edges (6)
b) Obtain a Prefix code to send the message ROAD IS GOOD using labeled binary
tree and hence encode the message (7)
c) Apply merge-sort to the list: -1,7,4,11,5,-8,15,-3,-2,6,10,3 (7)
4 a) State Kruskal’s algorithm and using this algorithm find a minimal spanning
tree for the weighted graph shown below (7)
A
3 5
F B
3
2 2
3
4
5
E C
2 4
D

Fig. 4a

b) Explain Max-Flow, Min-Cut theorem. Apply this to the following transport


network to obtain the Max-flow. (8)
b
2,2
2,10
z
a c
9,0

3,3 5,5

d
c) Explain the steps in Dijikstra’s Shortest Path Algorithm. (5)

PART B

5 a) A Computer Science Professor has seven different Programming books on a


bookshelf. Three of them deal with C++, the other four with Java. In how many
ways can the Professor arrange these books on the shelf (8)
i) If there are no restrictions.
ii) If the languages should alternate
iii) If all the C++ books must be next to each other.
iv) If all the C++ books must be next to each other and all the Java
books must be next to each other
b) Explain the Binomial Theorem. Obtain the Coefficient of xyz2 in the expansion
of (2x-y-z)4 (5)
c) Define Catalan Number. In how many ways can one arrange three 1’s and
three –1s’s so that all the six partial sums (starting with the First summand)
are non negative? List all the arrangements. (7)

6 a) In how many ways can one arrange the letters in CORRESPONDENTS so that
i) There are exactly two pairs of consecutive identical letters
ii) There are at least three pair of consecutive identical letters. (8)

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 (5)

c) An apple, a banana, a mango and an orange are to be distributed to four 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 returns orange. In how many ways the
distribution can be made so that no boy is displeased? (7)

7. a) Determine the Coefficient of X8 in 1/(x-3)(x-2)2 (7)

b) Determine the sequence generated by exponential generating function


e2x – 3x3 + 5x2 + 7x (7)

c) Find all the partials of 7 (6)

8. a) Solve Linear recurrence relation.


Cn = 3Cn-1 -2Cn-2 with C1 = 5, C2 = 3 (6)

b) Find the generating function of an + an-1 -6an-2 for n>=2, a0=-1 and a1=8 (7)

c) Find the generating function of ar + 5ar-1 + 6ar-2 = 3r2 (7)

You might also like