Fourth Semester B.E. Degree Examination, Dee.201%
Design and Analysis of Algorithms
Time: 3 brs Max, Marks: 80
Note: Answer any FIVE full questions, choosing
‘ONE fall question from exch mode
Module:
BE 1 a What isan algorithm? What are the properties of an algo? pain Aon example.
2 b. Explain the general plan fir analysing the efficiency ofa Rcutaveizorithm. Susgest a
recursive algordhm 10 Find factors ot «number Derive elfen cokMtais)
© IP tn) © Otay (a) and isto) © OXg: Em) prove seb HEL a en)
Distinguish between the to comm eaySTO FEES graph 4 Mars)
Discuss about the important imal: perind fundamental data stustwes. (06 Marks)
Modute-2
3 Discus cutee ths to sort an array and trace fr the follow ng dataset, Draw the
trce of ease calle mae
i Derive the best cae complenity of quik sort algorithm (v0 stn
£2 briefly explain he Strassen's mauix makiphicalon Obtain ts tin complexity, (Marks
on
© 4 a Explainthe concept of divide and conquer Design am algorithm for merge sort aa derive its
: time complex (a0 Marty
t b What are the three major variations of decrease and conquer technique? Explain with an
Iscse3
Madule3
Esplin he corer of preody techniqn fr Prin‘ len Oba inion cn
spanning tes fore gupta Fie St) ‘conn
Solve he helow instance ofthe single source shortest path problem ih eM 6 asthe
source, With bp uber (uses
i ap)
{ }° 6 (ee
( > ©
36 .
Fe QS
on
6 8. Whatare tna os? Expl, Cia
Charade fa PE] C [DLE
tdhaley FOS}. 035 [OS OT Oa | O
A (os marks) 6 a. Yat are Hufiman trees? Explain, Constradti@atifiman code for the following data
mle | C [DIE
Probability | OS}, 035 | 05/01 |04 | 02
Character
le DAD_CBB ising Huliniin encoding (08 Marks)
in tahsioem and conguertechnique. Sort the below list us
2. 4
Heap sort
16. 5 (08 Marks)
jodu
7 f @eiih@yuansitive closure of a graph. Write Warshall’s al
closure of
ithm to compute transitive
‘iseeted graph. Apply the same on the graph defined by the following adjacency
matrix
o1 80
ood
R (08 Marks)
ooo
0000
ic programming, solve the below instance of knapsack prob
item _| Weight | Val
1 12
10 | Capacity w= 5
20
(08 Marks)
15CS43 USN 17843
Fourth Semester B.E. Degree Examination, Dec.2019/Jan.2020
Design and Analysis of Algorithms
Time: 3 hs. Max. Marks: 100
Note: Answer any FIVE: fall questions, choosing ONE full question from each module.
& Module-1
i Explain Asymptotic notations in detail with example 2 Maris
i Outline an algorithm to find maximum ofnciements and obtain ts time complexity
a tos Marts)
i on
gf 2 a Design algorithm fortower of Hanoi problem and obaintimecomedi,
Probability [0.4 [0.1] 021 015/015
fA ae text ABACABAD and decode 100010111001010 ‘av mans
Caleu
te the shortest distance and shortest path from vertex 5 to vertex 0 using Dijkstra’
(lO Marks) 4
b
b
Max. Marks: 80
Note: Answer any FIVE full questions, choosing
ONE fall question from each module.
Modute-1
Write an algoriths to find the maximum clement in an array of n clemi@AiNGive the
mathematical analysis of this non-recursive algorithm, se siarks)
Explain the asymptotic notations BigO, BigQ and big thetaflised tol comyfare orders of
rowth of an algorithm, {06 Viarks)
Explain with an example how a new variable count introduced in a program Gaa'be used 10
find the number of steps needed by a program to solve a particle problem instance
(ou Mars)
oR
Write a recursive function to find and print allyfgssible peemutations of a give
ni clements ws
Solve the recurrence relation : Ming. 2M(n ~ Hr Ritake M(1) = 1, Min) is given for
n> (05 Marks)
Define algorithm. What are the criteria that an algofithm must satisfy (06 Marks)
Module?
Write @ function to find thefing,imum-apd minimum elements in given array of n elements
by applying the divide arid conquer teefanique. (06 Marks)
Explain the divide/and eonguer technique. Give the xeneral algorithm DAndC(P)| Where P is
the problegtto be salve}.to ilustate this technique (04 Marks)
Apply soles temovalimethodwo obtain topological sort for the given graph in Fig.Q3(c)
(06 Marks)
Fig.Q3(6)
oR
Explain the merge sort algorithm. Ilustrate with an example and give the worst case
efficiency of merge-sort (08 Marks)
Apply quick sort algorithm to the following set of numbers.
£65, 70, 75, 80, 85, 60, 55, 50,45. (08 Marks)
1SCS43
Apply greedy method to obi
n an optimal solution to the knapsack problem given M = 60,
1 Wa, Ws) = (5. 10, 20, 30, 40) (Ps, Po. Pr. Ps: Ps) = GO, 20, 100, 90, 160). Find the
{otal profit earned. (04 Marks)
Explain Huffman algorithm, With nple show the construction of Huffman tree and
generate the Huflman code using this tr (06 Marks)
Apply Prim’s algorithm to obtain a minimum spanning tree for the given weighted
connected graph. [Fig. Q5(e)} (06 Marks)
