Académique Documents
Professionnel Documents
Culture Documents
co
m
2.
3.
Define ADT.
4.
5.
6.
7.
B.
g.
10.
ww
w.
aa
na
va
N.
1.
PARTB-(5x16=80marks)
11.
(a)
(i)
(ii)
(6)
Or
(b)
L2. (a)
(b)
13. (a)
Or
(b)
14. (a)
(i)
(8)
(ii)
(8)
Write ADT operations for heap sort. Using the above algorithm, sort the
following:
35 45 25 rr 6 85 1735.
(ii)
(8)
(8)
Explain Dijkstra's algorithm using the follou'ing graph' Find the shortest
path betweenv1 to v2, v3, v4, v6, v7'
(b)
w.
aa
na
va
(a)
Or
(i)
(8)
(ii)
(8)
ww
15.
(i)
N.
(b)
co
m
Or
D 4032