Professional Documents
Culture Documents
Cs2201-Data Structures-R8 PDF
Cs2201-Data Structures-R8 PDF
E3059
Computer Science and Engineering CS2201 DATA STRUCTURES (Regulation 2008) Time: Three hours Answer ALL Questions PART A (10 2 = 20 Marks) 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. Define List Abstract Data Type with example. Mention the Applications of stack.
21
e h t b
Or
List out the structural properties of B-Trees. Mention the difference between Hashing & Extendible Hashing with example. Define Path Compression. What is topological sort? Give algorithm. What is biconnected graph? Give example. PART B (5 16 = 80 Marks)
ww
21
11. (a) (b)
4
a r g w.
w e n
4
Maximum: 100 Marks
m o .c
21
12.
(a)
Define Tree. Explain the tree traversals with algorithms and examples. Or
(b)
14.
(a)
Describe Equivalence Relations. Write down the algorithm for dynamic equivalence problem. Or
Explain open addressing with its probing in detail. Explain any one of the shortest path algorithms with suitable example. Or
(b)
Describe the Prims algorithm for minimum spanning tree. Give an example.
21
ww
21
2
4
a r g w.
e h t b
w e n
4
m o .c
Explain heap structures. How are binary heaps implemented? Give its algorithm with example.
21
E 3059