Hey buddy

 All you need is here 

True change begins when we break free from old patterns, think beyond our limitations, and dare to challenge the impossible-because sometimes, the fool is just a visionary ahead of his time.

Module I
1 Implement program for Bubble sort.

2 Implement program for Insertion sort.

3 Implement program for Selection Sort.

4 Implement program for Shell sort.

5 Implement program for Radix sort.

Module II
1 Implement program for Linear Search.

2 Implement program for Binary Search.

3 Implement program for Modulo Division.

5 Implement program for Fold Shift.

6 Implement program for Fold Boundary.

7 Implement program for Linear probe for Collision Resolution.

Module III
1 Implement program for Stack using Arrays.

2 Implement program for Stack using Linked List.

3 Implement program for Evaluation of Postfix Expression.

4 Implement program for balancing of parenthesis.

Module V

1 Implementation of Queue using Linked List.

2 Implementation of Circular Queue using Array.

3 Implementation of Priority Queue using Linked List.

ModuleVI
1 Creating Binary Search Tree.

2 Traversal of Binary Search Tree.

3 Finding Maximum and Minimum Node of BST.

4 Counting number of nodes in BST.

5 Creating Max Heap.

6 Creating Min Heap.

7 Performing Reheap Up operation on Max-Heap.

8 Performing Reheap Down operation on Max-Heap.

Module VII
1 Graph Creation using Adjacency Matrix.

2 Breadth First Search (BFS) Traversal.

3 Kruskal’s Algorithm for Minimum Spanning Tree.