7/28/2019 ADA June 12

1/2

I r+ l-r,1 o 1 a\ D t( 3SN

b.CIq

dle1

Fourth Semester B.E. Degree Examination, June 2012Design and Analysis of Algorithms10cs43

Max. Marks:100

(06 Marks)

(04 Marks)

oooo.Eao6o

EP:hbo'troo.=Nb9!o-3Ea:oOdoo0i.s63oo-Atro.o..o .-j,i .aa)=AE,!oO.X>'!oo-eoao=o- ;iF>=o!->\U 0. (10 Marks)8 Write short notes on:a. Traveling salesperson problem.b. Input enhancement in string matching.1:\, c. Decision trees.C) d. Challenges of numericalalgorithms.

*:Frr{