ALGORITHMS-LAB-V-SEM
This repository contains the problems discussed in Algorithms Lab III-Year I-Sem at Vignan’s Institute of Information Technology Visakhapatnam.
LIST OF EXPERIMENTS
| Ex | Name of the Experiment | Topics Covered |
|---|---|---|
| 1 | Implement recursive binary search algorithm | Exercise_01_Divide_and_Conquer_technique |
| 2 | Implement recursive quick sort algorithm | Exercise_02_Divide_and_Conquer_technique |
| 3 | Implement recursive merge sort algorithm | Exercise_03_Divide_and_Conquer_technique |
| 4 | Implement randomized quick sort algorithm | Exercise_04_Divide_and_Conquer_technique |
| 5 | Find optimal solution for a Knapsack problem | Exercise_05_Greedy_method |
| 6 | Find the shortest path using single source shortest path algorithm | Exercise_06_Greedy_method |
| 7 | Implement Huffman coding technique | Exercise_07_Greedy_method |
| 8 | Implement 0/1 Knapsack problem | Exercise_08_Dynamic_programming_technique |
| 9 | Find the shortest path using all pairs shortest path algorithm | Exercise_09_Dynamic_programming_technique |
| 10 | Implement traveling salesperson problem | Exercise_10_Dynamic_programming_technique |
| 11 | Implement sum of subsets | Exercise_11_Backtracking_technique |
| 12 | Implement N-Queen’s problem | Exercise_12_Backtracking_technique |
| 13 | Implement Longest Common Subsequence Problem | Exercise_13_Dynamic_programming_technique |
| 14 | Implement Heap Sort Technique | Exercise_14_Divide_and_Conquer_technique |
| 15 | Implement B-Tree and its Operations | Exercise_15_Data_Structures |
| 16 | Implement AVL Trees and Operations | Exercise_16_Data_Structures |