Professional Documents
Culture Documents
Data Structures and Algorithms2011
Data Structures and Algorithms2011
Data Structures and Algorithms2011
M 19287
Name | .............................t.......
- including Part Time) B.Tech.(Reg./Sup./Imp. IV Semester DegreeExamination,June 20ll (2007Admn.) 2K6CS/IT 402: DATA STRUCTURESAND ALGORITHMS
Time:3 Hours
and time complexityof a program. I. a) Define space datatype with example. b) Explain structure of circularlinked list over a linear list ? c) What arethe advantages OrdinaryQueueandCircularQueue. d) Distinguishbetween e) Write a shortnote on heapmanagement. 0 Write a note on prioritY queue. g) Discussdifferenthashingfunctions. orderusingtheBubbleSortalgorithm. (8x5=' h) Sort 10,15,6,5, 8, 12 nascending II. 1) a) Find theBig-oh notationfor the following : r) 8n + 4n3+ 8na ii) n2+nlogn
Max.Marks:100
10
, f,
OR
P.T.O.
M 19287
how nodescanbe addedanddeletedfrom themiddle 2) a) Explainwith diagrams, '.!..r ,i r b) Write an algorithmto convertan'infix string into a postfix string.Traceyour 10 algorithmon the following string:
I
rv. 1) a)
7 8
OR
of graph. 2) a) Explain any 3 methodsof representation
rcf
v. 1) a)
AJ
--=-_f
6 6
OR
@.
/ \
@ @
What is a heap?Write an algorithmto sort an arrayof integersusingthe heap on the sortmethod.Given 30, 61,52,42, 15,90, 88, 37 arethe elements of sorting. 15 array.Show the differentstages
10