Vous êtes sur la page 1sur 2

# vtuplanet.

com
USN
I

r+

l-r,1

a\

t( 3

10cs43

## Design and Analysis of Algorithms

Time: 3 hrs.
o o o o.
E
a

Max. Marks:100
Note: Answer FIVE full questions, selecting at least TWO questions from each part.

## I a. If t1(n) 0 (gr (n)) and t2 (n) e 0(gz (n)), prove that

b. c. 2 a. *b. '
(06 Marks) t1(n) + t2(n) e 0(max {gr(n), g:(n)}). denotes the, number of moves in tower of Hanoi puzzle when n disks are involved, (07 Marks) give a recurrence relation for M(n) and solve this recurrence relation. Give an algorithm for selection sort. lf C(n) denotes the number of times the algorithm is (07 Marks) executed (n denotes input size), obtain an expression for C(n).

PART _ A

o 6 o

If M(n)

EP
:h

## bo' troo .=N

b9!
o-

3E
a:

dl
e1

c. d.

Assuming that n is a power of 2, solve the recurrence relation T(n) : 2T(n/2) + 2. Take (05 Marks) T(2): 1 and T(1) : 0. If ne [2k-r.2k), prove that binary search algorithm makes at most K element comparisons for a successful search and either K - I or K comparisons for an unsuccessful search. (06 Marks) (05 Marks) Give an algorithm for merge sort. Consider the numbers given below. Show hou,partitioning algorithm of quick sort will place 106 in its correct position. Show all the steps clearly.

.s6 3o
o-A
o.. o .-j ,i .a
a)=

oO do o0i

106 tt7

## 128 134 141 9t 84 63

6:
ir, iz, i2,.......,

42.

(04 Marks)

3 a.
b.

## Let J be a set of K jobs and

ir. be a permutation

## ofjobs in J such that

(07 Marks) (07 Marks)

## processed in the order o without violating any

Using Prim's algorithm, determine minimum cost spanning tree for the weighted graph
shown below,

tro.
AE,
!o O.X

CIq

fig.Q.3(b):

>'! ooeoa
o=

o- ;i

U<
-.i 6i o

F> =o 5! ->\

c.

Fig.Q.3(b) In the weighted digraph given below, fig.Q.3(c) determine the shortest paths from vertex I (06 Marks) to all other vertices.

z
d

2W
Fig.Q.3(c)
1

0.

of2

vtuplanet.com
10cs43

4a.
,4

Obtain the shortest paths from every vertex to every other vertex in the diagraph given (10 Marks) below; fig.Q.a(a)

b'

Fig.Q.a(a) Using Warshall's algorithm, obtain the transitive closure of the matrix given below:

2-

(o r o o) In o o rl R=l l0 0 0 0lI. II 0 I 0) [t

(lOMarks)

5a.
b.

PART _ B
Show how insertion sort algorithm arranges the following members in increasing order. (06 Marks) 34. (06 Marks) Obtain topological sorting for the diagraph given below:

61 28 9 85

frFig.Q.s(b)
Give algorithms for the fbllowing: i) Comparison counting; ii) Distribution

3"
6.a. q
b.

counting.

(08 Marks)

nr. ) 7 a.

Define the following: i) Tractable problems; ii) Class P; iii) Class NP; iv) Polynomial (05 Marks) reduction; v) NP complete problems. problem. back tracking, obtain State subset sum Using a solution to the subset sum problem (07 Marks) by taking s: {6, 8,2,14} and d: 16. Explain approximation algorithms for NP - hard problems in general. Also discuss (08 Marks) approximation algorithms for knapsack problem.
What is prefix computation problem? Give the algorithms for prefix computation which uses

i) n processors; ii)

a
log n

## p.o."ssors. Obtain the time complexities of these algorithms.

(10 Marks)

b.

x n matrix M with nonnegative integer coefficients, define M and give an algorithm for computing fr. Prove that ft can be computed fiom an n x n matrix M in 0(log n) time using n'u' common CRCW PRAM processors for any fixed e > 0. (10 Marks)
For an n
Write short notes on: Traveling salesperson problem. Input enhancement in string matching. Decision trees. Challenges of numericalalgorithms.

a. b. 1:\, c. C) d.

(20 Marks)

vtuplanet.com *:Frr{<t<
2

of2