Semester6-SPPU-Design-and-Analysis-of-Algorithms

1) Assignment 1 :- Write a program to find Maximum and Minimum element in an array using Divide and Conquer strategy and verify the time complexity.
2) Assignment 2 :- Write a program to solve optimal storage on tapes problem using Greedy approach.
3) Assignment 3 :- Write a program to implement Bellman-Ford Algorithm using Dynamic Programming and verify the time complexity.
4) Assignment 4 :- Write a program to solve the travelling salesman problem and to print the path and the cost using Dynamic Programming.
5) Assignment 5 :- Write a recursive program to find the solution of placing n queens on chessboard so that no two queens attack each other using Backtracking.

6) Assignment 6 :- Write a program to solve the travelling salesman problem and to print the path and the cost using Branch and Bound.

Reference videos:
Pratctical 1:
https://www.youtube.com/watch?v=esDnuGD6kb0

Practical 2:
https://www.youtube.com/watch?v=AATIeMs3T7s
https://forgetcode.com/c/104-pass-two-of-a-two-pass-assembler

Practical 4:
https://www.youtube.com/watch?v=AxLgkLIAOCc

Practical 5:
https://www.youtube.com/watch?v=jZqhh3kj3xU

Practical 6:
https://www.youtube.com/watch?v=Ot20nuofu5k

Practical 7:
https://www.youtube.com/watch?v=rUDxhF-PE6s