| Assignment | Problem Statement |
|---|---|
| Assignment1 | Data Preparation |
| Assignment2 | Regression Technique |
| Assignment3 | Classification Technique |
| Assignment4 | Clustering Technique |
| Assignment | Problem Statement |
|---|---|
| Assignment1 | Write a program to implement Fractional knapsack using Greedy algorithm and 0/1 knapsack using dynamic programming. Show that Greedy strategy does not necessarily yield an optimal solution over a dynamic programming approach. |
| Assignment2 | Write a program to implement Bellman-Ford Algorithm using Dynamic Programming and verify the time complexity. |
| Assignment3 | Write a recursive program to find the solution of placing n queens on the chessboard so that no two queens attack each other using Backtracking. |
| Assignment4 | Write a program to solve the travelling salesman problem and to print the path and the cost using LC Branch and Bound. |