(©) Define alpins, What ate the properties af an algorithm’? Diferente between Des
O an a 9 eo, en te a ere Pt
Sa at a
9 Wet an lon for Quick Sort. Analyze the bel, average ad worst ease complet of
ick Son 2 fa CH WARN Quick Son A aT ah ae amd rem
‘een af
he ati Even
Ponte At re a a A
be tee? Prove ht asik
st node has eight most 2 los).
A ener AL Red Dick Tree $ a am À ? a
ste Rod Blak Tee STE og) Pı
Heap son a ST ae Di
Pw
A(12,15,17,18, 13,11, 19,16)
(©) Define Tes, Create
Bares of 2 by inserting the elements <I1, 42,23, 4,15, 1627,
68,79, 98,26, 94,
Tree 8 On A we k= 2 DR <1 42,23, 44,
(2) Show the Red Black tree afer inseeting the keys <41, 38, 3,12, 19, $ ino an ini
emmy re blacks
41, 36,31, 12,19, 8 FSA
ER Red Back re À keys rah à
Rar
(0 Diffretiste between greedy method and dynamic programming Esplin the principle of
Greedy AR Of dynamic HEN eae Greedy A a
gran fr à rat
À ge seen ur À rame
(9, Discuss Fractional pase p
a optimal solution tothe knapsack instance ned
64.3.5)
4 Pe HET apr STE and BR HE knpsack el
Am am (10, 5.7.11) 4.3.5) EH TE ar
a