BVC ENGINEERING COLLEGE (AUTONOMOUS) :: ODALAREVU
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
II B.TECH I SEMESTER (BR20) - Course Code : 20CS3L06
ADVANCED DATA STRUCTURES LAB
S.NO PROGRAM PAGE NO
1 To implement functions of Dictionary using Hashing ( division
1-8
method, Multiplication method, Universal hashing)
2 To perform various operations i.e., insertions and deletions on
9-19
AVL trees
3 To perform various operations i.e., insertions and deletions on
2-3 trees 20-25
4 To implement operations on binary heap 26-28
5 To implement operations on graphs
i) vertex insertion
ii) Vertex deletion 29-37
iii) finding vertex
iv) Edge addition and deletion
6 To implement Depth First Search for a graph non recursively 38-39
7 To implement Breadth First Search for a graph non
40-41
recursively
8 To implement Prim’s algorithm to generate a min-cost
42-45
spanning tree
9 To implement Krushkal’s algorithm to generate a min-cost
46-49
spanning tree
10 To implement Dijkstra’s algorithm to find shortest path in the
50-52
graph
11 To implement pattern matching using Boyer-Moore algorithm 53-54
12 To implement Knuth-Morris-Pratt algorithm for pattern
55-58
matching
