CP5161 DATA STRUCTURES LABORATORY

CP5161 DATA STRUCTURES LABORATORY

LAB MANUAL

CONTENTS

S. No	Experiments
1a	Implementation of Merge Sort analysis
1b	Implementation of Quick Sort analysis
2	Implementation of a Binary search Tree
3	Red-Black Tree Implementation
4	Heap Implementation
5	Fibonacci Heap Implementation
6	Graph Traversals
7a	Spanning Tree Implementation (Kruskal’s algorithm)
7b	Spanning Tree Implementation (Prim’salgorithm)
8a	Shortlist Path Algorithms (Djikstra’s algorithm)
8b	Shortlist Path Algorithms (Bellmann Ford Algorithm)
9	Implementation of Matrix Chain Multiplication
10a	Activity Selection
10b	Huffman Coding Implementation