DATA STRUCTURES AND ALGORITHMS LAB (CSP-003)

Data Structures and Algorithms Lab Manual

S. NO.	PRACTICAL NAME
1.	Write programs to implement the following using an array: a) Stack ADT b) Queue ADT
2.	Write programs to implement the following using a singly linked list: a) Stack ADT b) Queue ADT
3.	Write a program to implement the deque (double-ended queue) ADT using a doubly linked list.
4.	Write a program to perform the following operations: a) Insert an element into a binary search tree. b) Delete an element from a binary search tree. c) Search for a key element in a binary search tree.
5.	Write a program to implement Circular Queue ADT using an array.
6.	Write a program to implement all the functions of a Dictionary ADT using hashing.
7.	Write a program to perform the following operations on B-Trees and AVL-Trees: a) Insertion b) Deletion
8.	Write programs for implementing Breadth-First Search (BFS) and Depth-First Search (DFS) for a given graph.
9.	Write programs to generate a minimum-cost spanning tree using: a) Prim's Algorithm b) Kruskal's Algorithm
10.	Write a program to solve the Single Source Shortest Path problem using Dijkstra's Algorithm.
11.	Write a program that uses non-recursive functions to traverse a binary tree in: a) Pre-order b) In-order c) Post-order
12.	Write programs for sorting a given list of elements in ascending order using the following sorting methods: a) Quick Sort b) Merge Sort