www.aktuonline.

com

Printed Pages: 4 NCS-501

(Follox'ing Faper ID and Roll No. to he filled in your

Answer Book)
Roll No.

B. Tech.

(SENI. V) THEORY trXAMII\ATION, 2015_1 6

DESTGN AND AJ\ALYSIS OF A LG ORITHIVI

[Tirne:3 lioursl Maxirnurn Marks:1001

www.aktuonline.com

Section-A
Note : Ali cluestions Are conrpulsory

1. Attcrnpt all parts . All parts carrv equal rnarks. Write

answer of all part in short . (2x1 0:20)

(a) Justifu'ohy Quick sort is better than Merge sort ?

(b) What is priority queue ?

(c) Find out l{arniltonian cycles in complete graph

having'n' vertices.

(d) fxpiain binornial heap with properties.

(e) Explain element searching techniques using divide

and conquer approach.

17500 (1) P.T.O.

www.aktuonline.com
 www.aktuonline.com

(0 Find the subsets-of sum of following problem.

Given total elernents are (S)- {4,2,7,6,8} and
maximum SLIM is (X):8.

(g) Explain dynamic prosamming. How it is difflerent

from greedy approach ?

(h) Solve the given reculrence T'(n)- 4-l(*14)+n

(i) Ilifftrences back tracking and branch &" bound

programming approach.
www.aktuonline.com

(i ) Explain the P, NP and NiP- complete in decision

problems.

SECTIOI{-B

Note:Attempt any live questions frorn this section. ( l0x5-50)

2. Explain insertion in Red Black

'free. Shorv steps for
inserting 1,2,3, 4,5, 6 ,7 ,8 & 9 into ernpty RB tree.

3, l)iscuss knapsack problern rvith respect to rJ,vnamic

programming approach. Irind the optirnal solution for
given solution for given problern. w (r,veight set) :-
{5, 10, 15, 2A\ and W (Knapsack si ze): 8.

4. What is heap sort ? Apply heap sort algorithm for sorting

'r,2,3, 4, 5, 6,7, B, 9., 10. Also deduce time complexity
of heap sort.

175m (2) NCS.5O1

www.aktuonline.com
 www.aktuonline.com

5. Explain B-Tree and insert eter,nents B, Q, L,,F i*to B-

Tree [Fig: I J then apply deletion af elements F, M., (i D.
B on resulting B-'free.

Fig. I
www.aktuonline.com

'Write
Q6. an algorithm for solving n-queen probleffi. Show
the solution of' 4 queen probleln using bracktrarcking
approach,

Q7. Explain a greedy single source shorlest path algoritlun

rvith example.

Q8" \,Vhat is string rnatching algorithm ? fxplain Rabin-Karp

methcld u,ith examples.

Q9. Explain Approximation algorithnrs rvith suitable

examples.

SECTION-C

Irlote:Attempt any two questions frcm this section. ( 15x2:30)

tr0. What is Fibonacci heap ? trxplain COi{SOLII);tif

operation with suitable example fto Fibonacci heap.

r75ffi (3) PT.O.

www.aktuonline.com
 www.aktuonline.com

it. What is minimuril spanning iree ? fxplain Prirn

Algorithrn and find MST of graph [Fig:Z)

Fig: 2
www.aktuonline.com

12. ['rpiain TSP (trai,eiing sales person) problern u,ith

-['SP
exarnple. \\/rite an approach to sitlr,e prclblsm.

-"-x---

17500 (4) NCS.5O

www.aktuonline.com I