View Code? Open in Web Editor
NEW
This repository contains LP-I assignment of SPPU, Third Year IT Syllabus (2019 pattern)
C++ 0.58%
Jupyter Notebook 99.42%
lp-i's Introduction
LP-I Assignment of SPPU Third Year IT Syllabus (2019 pattern)
Design and Analysis of Algorithm (DAA)
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.
lp-i's People
Contributors
Watchers