Scribd
Upload
18 views

DMGT - Assignment-2

dmgt problems

Uploaded by

rvkaushal.jntuk
Copyright
© © All Rights Reserved
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
18 views

DMGT - Assignment-2

dmgt problems

Uploaded by

rvkaushal.jntuk
Copyright
© © All Rights Reserved
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/ 6

II B.

TECH I SEM CSE (AIML)

ASSIGNMENT - II

Roll numbers 1 to 10:

1. Calculate the coefficient of 𝑥15 in


𝐴(𝑥) = (𝑥 2 + 𝑥 3 + 𝑥 4 + 𝑥 5 )(𝑥 + 𝑥 2 + 𝑥 3 + 𝑥 4 + 𝑥 5 + 𝑥 6 + 𝑥 7 )(1 + 𝑥 + ⋯ + 𝑥15 )

2. Using method of generating functions solve the recurrence relation


𝑎𝑛 − 9𝑎𝑛−1 + 26𝑎𝑛−2 − 24𝑎𝑛−3 = 0 for 𝑛 ≥ 3 with initial conditions 𝑎0 = 0, 𝑎1 =
1 and 𝑎2 = 10

3. State and prove Euler formula.

4. Define Isomorphism of graph. Check the following graphs are isomorphic or


Not

5. Define what is meant by minimal spanning tree. Find the minimal spanning tree of the
following Graph using Kruskal’s Algorithm
Roll numbers 11 to 20:

1. Find the Coefficient of 𝑥 23 and 𝑥 32 in (1 + 𝑥 5 + 𝑥 9 )10

2. Using Method of characteristic roots solve the recurrence relation


𝑎𝑛 + 5𝑎𝑛−1 + 6𝑎𝑛−2 = 3𝑛2 − 2𝑛 + 1

3. What is a Hamiltonian Cycle? Draw bipartite graph 𝐾3,4 and prove that this graph
does not have a Hamiltonian cycle.

4. Explain (i) Adjacency matrices (ii)Isomorphism of graph with help of following


graphs and check the following graphs are isomorphic or not

5. Find the minimal spanning tree of the following graph


Roll numbers 21 to 30:

1. Expand the multinomial (𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 )4

2. Solve the recurrence relation 𝑎𝑛 − 5𝑎𝑛−1 + 6𝑎𝑛−2 = 𝑛(𝑛 − 1) for 𝑛 ≥ 2, 𝑎0 =


1, 𝑎1 = 5 using method of generating functions.

3. Define Hamilton cycle and Euler’s cycle. Check whether 𝐾𝑛 has Hamilton cycle and
Euler’s cycle for 𝑛 ≤ 4

4. Check whether the following graphs are isomorphic or not?

5. Find the minimal spanning tree of the following graph using Kruskal’s algorithm
Roll numbers 31 to 40:

1. Find the number of non negative integral solutions for the equation
𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 = 50, where 𝑥1 ≥ 2, 𝑥2 ≥ 4, 𝑥3 ≥ −3, 𝑥4 ≥ 7

2. Solve 𝑎𝑛 − 6𝑎𝑛−1 + 8𝑎𝑛−2 = 𝑛4𝑛 , where 𝑎0 = 8, 𝑎1 = 22

3. State and prove Euler formula.

4. Show that the following graph is not Hamiltonian.

5. Use Prim’s algorithm to find a minimum spanning tree for the graph
Roll numbers 41 to 50:

1. How many different five digit numbers can be formed from the digits 0,1,2,3 and 4?

2. Solve 𝑎𝑛 − 7𝑎𝑛−1 + 10𝑎𝑛−2 = 6 + 8𝑛 with 𝑎0 = 1, 𝑎1 = 2

3. Define the following:

(i) Graph (ii) Directed Graph (iii) Simple Graph


(iv) Multi Graph (v) Finite Graph (vi) Null Graph and give one example to each

4. What is a Hamiltonian Cycle? Draw bipartite graph K3,4 and prove that this graph
does not have a Hamiltonian cycle.

5. Define minimum spanning tree and hence construct minimum spanning tree of the
following graph
Roll numbers 51 to 60:

1. In how many ways can 23 different books be given to 5 students so that 2 of the
students will have 4 books each and the other 3 will have 5 books each?

2. Find the coefficient of 𝑥10 in (1 + 𝑥 + 𝑥 2 + ⋯ )2

3. Solve the recurrence relation 𝑢𝑛 − 2𝑢𝑛−1 − 2𝑢𝑛−2 = 5𝑛 , 𝑢0 = 1, 𝑢1 = 1.

4. Obtain spanning tree of the graph using DFS algorithm

5. construct minimum spanning tree of the following graph using Prim’s algorithm

You might also like