Sie sind auf Seite 1von 13

Sub: MFCS

name: K.Gnana mayuri Sec: II IT A & B SET 1

Faculty

1)

(i). Four different mathematics books, 5 different CSE books and two different control theory books are to be arranged in a shelf. How many different arrangements are possible if (a) The books in each particular subject must all be together. (b) Only the mathematics books must be together. (ii) Find the number of n so that 2p(n,2) + 50= p(2n,2).

2)

(a) Find the generating functions for the following sequences:(1) 12,22,32 (2) 1,1,0,1,1,1 (b) Determine the coefficient of :(1) x12 in x3(1-2x)10 (2) x0 in (3x2-2x)15 (c) Find the coefficient of x18 in following products:(1) (x+x3+x5+x7+X9) (x3+2x4+3x5+....)3

3)

(I) Define the following with examples a) Directed Graph and Isolated Vertex b)Bipartite Graph and Complete Graph c) Order and size of a graph d)Multigraph e) Plannar and non plannar graphs

(II) Find the in-degrees and out degrees of the vertices of the Digraph shown below:V1 V6 V5 V7 V4 V2 V3

4) Find DFS for the following graph

SET 2 (a) Find the number of permutations of the letters of the word SUCCESS. (b) How many 9 letter words can be formed using the letters DIFFICULT?
1)

2) (i)Find the sequences generated by the following functions:(a) (3+x)3 (b) 2x2(1-x)-1 (ii) Find the generating functions for the following:(a) 1,2,3,4 (b) 1,-2, 3,-4 (c) 0,1,2,3

3) (i) Define Isomorphism? Test whether the following are

Isomorphic or not? (a) V1 V3 (b) A D

V2 V4 B C

V1 V3 P S

V2 V4 Q R

(II) Define

compliment of a sub graph. Draw the compliment of given graphs

K4

(III) Find the order & degree of the following:1. 2. A Q X P B R

3. Y
Z 4. N

C
O

4. Find the BFS for the following graph.

SET 3

1) (a) Find the number of committees of 5 that can be selected from 7men and 5 women if the committee is to consist of at least 1 man and at least 1 woman? (b) At a certain college, the housing office has decided to appoint, for each floor, one male and one female residential advisors. How many different pairs of advisors can be selected for a 7 floor building from 12 male and 12 female candidates?

2) (a) Using generating function, find the number of:(i) Non negative and (ii) positive integer solutions for the equation x1+x2+x3+x4 = 25 (b) Find the generating function that determines the number of non negative solutions of the equation x1+x2+x3+x4+x5=20 under the constraints x1 < 3, x2 < 4, 2 < x3 < 6, 2< x4 < 5, x5 is odd with x5 < 9. 3(I) Define walk, cycle, path, trail, circuit. (II) Test the following (i) V1 e1 V2 e3 e2 V3

V5 for trail if the walk v1e1v2e3v5e3v2e2v3

(ii)

V2

e2 e5

V3 for cycle if the walk is

e3 v2e2v3e5v5e3v2 V5 (iii) V2 e1 V1 e2 e3 e4

V3 e5 V5

For circuit if the walk is v1e1v2e3v5e5v3e7v4e6v5e4v1 Test the following Euler graph and Euler circuit P e1 Q T Take the walk Pe1 Q
e2

(III)

e4 e3 e2

S e5 R e7 e6

Re3 Pe4 S e5 Re6 Te7 P. Give reasons

4. Using Kruskals algorithm, find a minimal Spanning tree for the weighted graph shown below and also define weighted graph.

SET 4 (a) In how many can we distribute 7 apples and 6 oranges among 4 children so that each gets at least one apple? (b) State and explain pigeon hole principle clearly with an example?
1)

2) In how many ways can 12 oranges be distributed among 3 children A, B, C so that A gets at least 4, B and C gets at least 2, but C gets not more than 5.

) Find the degrees of the following graph using Eulers formula and prove handshaking property.
3(I)

R2 R1 R3 R4 R6 R5

(II)

Define Hamilton cycle & Hamilton Path

4)Using Prims algorithm, find a minimal spanning tree for the weighted graph shown below

SET 5

1) (a) A certain question paper contains 3 parts A,B,C with 4 questions in part A, 5 questions in part B and 6 questions in part C. It is required (b) And the coefficient of x9y3 in the expansion of (2x3y)12 ?

(a) Solve the recurrence relation using second order an + an-1 -6an-2=0. Given that a0 = -1 and a1 = 8. (b) Solve the recurrence relation using 3rd order an + an-1 -8an-2 -12an-3=0 Given that n > 3, with a0 =1, a1 =5, a2=1.
2)

(a) Define sub graph, spanning sub graph and induced sub graph. (b) Test whether the following are spanning sub graphs and also find out sub graphs A A
3)

B C D (1)

B D

(2)

(3) (c) Test for induced sub graph V2 V3 V1 V2

V2

V1 V5 (c) V5 V3 (a) V4

V1 V5 (b) V3

4) Define a) Tree b) Spanning tree c) Balanced tree d) Draw the possible spanning trees for the following graph (I) v1

V2

v3

v4

(ii)

v4

v5

V6

v7

Das könnte Ihnen auch gefallen