LIST OF PRACTICALS
| Sr. | Practical Title | Answer |
|---|---|---|
| 1 | Write a program to sort given elements of an array in ascending order using bubble sort. Analyze the time complexity for best, average and worst case. | Solution |
| 2 | Write a program to sort given elements of an array in ascending order using selection sort. Analyze the time complexity for best, average and worst case. | Solution |
| 3 | Write a program to implement heap sort. | Solution |
| 4 | Write a program to search given element from an array using sequential search and binary search. Analyze the time complexity for best, average and worst case. | Solution |
| 5 | Write a program to sort given elements of an array in ascending order using merge sort. Analyze the time complexity for best, average and worst case. | Solution |
| 6 | Write a program to sort given elements of an array in ascending order using quick sort. Analyze the time complexity for best, average and worst case. | Solution |
| 7 | Write a program to implement making change problem using greedy algorithm. | Solution |
| 8 | Write a program to implement the knapsack problem using greedy algorithm. | Solution |
| 9 | Write a program to implement making change problem using dynamic programming | Solution |
| 10 | Write a program to implement the knapsack problem using dynamic programming | Solution |
| 11 | Write a program to implement Floyd’s algorithm for finding shortest path using dynamic programming. | Solution |
| 12 | Write a program to implement chained matrix multiplication using dynamic programming. | Solution |
| 13 | Write a program to implement longest common subsequence using dynamic programming | Solution |
0 Comments