DS Lab Manual

                  COMPILER DESIGN LAB

S No	Name of the program
1	Implementation of Singly Linked List
2	Implementation of Doubly Linked List
3	Implementation of Multi stack in a single Array
4	Implementation of Circular Queue
5	Implementation of Binary Search Trees
6	Implementation of hash Table
7	Implementation of Heap
8	Implementation of Breadth First Search Techniques
9	Implementation of Depth First Search Techniques
10	Implementation of Prim’s Algorithm
11	Implementation of Merge Sort
12	Implementation of Quick Sort
13	Implementation of Dijkstra’s Algorithm
14	Implementation of Kruskal’s Algorithm
15	Implementation of Data Searching using divide and conquer technique
16	To Perform Various Operations i.e, Insertions and Deletions on AVL trees
17	To Implentation of Operations on Binary Heap -Vertex Insertion ii. Finding Vertex  iii. Vertex Deletion iv. Edge addtion and deletion
18	To Implentation of  static Hashing (Using Linear probing for Collisions)
19	To Implement of Huffmam Coding
20	To implement of B-Tree