Advanced Data Structures & Algorithms Lab (23A05403A)
Experiment-1:
Construct a BST for a given set of elements to perform the operations Creation, Insertion, Deletion. Display the content of BST using inorder traversal
Experiment-2:
Construct an AVL Tree for a given set of elements to perform the operations Creation, Insertion, Deletion. Display the content of AVL Tree using inorder traversal
Experiment-3:
Construct B-Tree an order of 5 with a set of 10 random elements stored in array. Implement searching, insertion and deletion operations
Experiment-4:
Construct Min Heap using arrays, delete any element and display the content of the Heap.
Source CodeExperiment-5:
Implement BFS and DFS for given graph, when graph is represented by Adjacency Matrix
Experiment-6:
Write a program for finding the bi-connected components in a given graph
Experiment-7:
Write a program to implement Quick Sort
Experiment-8:
Write a program to implement Merge Sort
Experiment-9:
Implement Job sequencing with deadlines using Greedy strategy.
Experiment-10:
Find the
distances from starting vertex to all vertices using Single Source Shortest
Paths (Greedy method) when the graph is represented by adjacency matrix
Experiment-11
Write a program to solve 0/1 Knapsack problem Using Dynamic Programming. (Set Method)
Experiment-12
Implement N-Queens Problem Using Backtracking.
Experiment-13
Use Backtracking strategy to solve 0/1 Knapsack problem.