View Code? Open in Web Editor
NEW
This repository contains the Assignment code of Design and Analysis of Algorithm Assignments of SPPU, Third Year IT Syllabus (2019 pattern)
lp1-daa-sppu-it-2019's Introduction
design-and-analysis-of-algorithm-DAA
This repository contains the Assignment code of Design and Analysis of Algorithm Assignments of SPPU, Third Year IT Syllabus (2019 pattern)
Assignment and Problem Statement
ASSIGNMENT
PROBLEM STATEMENT
Assignment 1
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.
Assignment 2
Write a program to implement Bellman-Ford Algorithm using Dynamic Programming and verify the time complexity.
Assignment 3
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.
Assignment 4
Write a program to solve the travelling salesman problem and to print the path and the cost using LC Branch and Bound.
lp1-daa-sppu-it-2019's People
Contributors
Watchers