Scribd
Upload
18 views3 pages

btech-cs-5-sem-design-and-analysis-of-algorithms-tcs-503-2011

Uploaded by

nc9997326177
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 views3 pages

btech-cs-5-sem-design-and-analysis-of-algorithms-tcs-503-2011

Uploaded by

nc9997326177
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/ 3

aktuonline.com aktuonline.

com

(Following Paper ill and Roll No. to be filled in your Answer Book)
• I Roll No.

B.Tech.
(SEM. V) ODD SEMESTER THEORY
-EXAMINATION 2010-11
DESIGN AND ANALYSIS OF ALGORITHMS

Note: (1) Attempt all questions.


(2) All questions carry equal marks.

(a) Determine the asymptotic order of the following


functions:
(i) fen) = 6·2n + n2•
(ii) fen) = 7.
(b) Solve the recurrence relation T(n) = 2T(.j;) + 1
whenever n is a prefect square greater than 1 and
T(2) = 3.
(c) Solve the recurrence relation using Master's Theorem:
T(n) = 7T(n/2) + 18n2, where n ~ 2 and a power of2.
(d) Write quick sort algorithm. Prove that the running time
. complexity of quick sort is O(n log n) in average.
(e) You are given an array ofn integers a1 < a2 < an. Give
an O(log n) algorithm that finds index i where a j = i or
prove that such i does not exist.
(f) Describe Heap sort algorithm.
TCS503NEQ-14853 1

aktuonline.com
http://www.UPTUonline.com
aktuonline.com aktuonline.com

Attempt any two parts of th (lox2=20)


(a) Show the Red black ~~ - ~sulted after
successively inserting ~ :_, 19, 8 into
an initially empty red b ~
(b) Define a B-tree of orde: - - - and let n be
:bat
2dh-1 - 1 :s; n :s; m:' - :

where h is the heigh


(c) Define Fibonacci h
and Fibonacci h" _

3. Attempt any two pans 1:-"-=: ~ (lOx2=20)


(a) 'Describe ee 'y ==:::0::. find the optimal solution
to the Kna - '.' stance n = 3, W = [100, 14, 10],
P = [20, 18, 1 -J and C = 116 using greedy method.
(b) Obtain the dynamic programming recurrence equations
for the 0/1 Knapsack problem of n instances. Assume
suitable data for n instances Knapsack.
(c) Consider a four vertex network as shown below. Find a
least cost tour using backtracking method.

aktuonline.com http://www.UPTUonline.com
aktuonline.com aktuonline.com

4. Attempt any two parts ofthe following :- (lOx2=20)


(a) Use Strassen's algorithm to compute the product of two
given matrices :

(b) Find the minimum cost spanning tree of the given graph
using Prim's algorithm.

(c) Describe Floyd Warshal's algorithm to find all pairs


shortest paths in a directed network.

Write short notes on any four of the following:- (Sx4=20)


(a) NP-Completeness.
(b). Randomized algorithms.
(c) Branch-and-Bound algorithm.
(d) Approximation algorithms.
(e) Hamiltonian cycle problem.
(f) Chromatic Number.

aktuonline.com http://www.UPTUonline.com

You might also like