Scribd
Upload
5 views2 pages

Lab Assignment 6 - Dynamic Programming

The document outlines a laboratory write-up for a Project Based Learning course focused on Dynamic Programming, specifically implementing the 0/1 Knapsack or Traveling Salesperson problem. It includes objectives, theoretical concepts, implementation details, and requirements for students to write their own theory, pseudo code, and analyze time complexity. Additionally, it features FAQs and practice assignments related to the topic.

Uploaded by

ramdasrana19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Lab Assignment 6 - Dynamic Programming

The document outlines a laboratory write-up for a Project Based Learning course focused on Dynamic Programming, specifically implementing the 0/1 Knapsack or Traveling Salesperson problem. It includes objectives, theoretical concepts, implementation details, and requirements for students to write their own theory, pseudo code, and analyze time complexity. Additionally, it features FAQs and practice assignments related to the topic.

Uploaded by

ramdasrana19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

S.Y. B. Tech.

Academic Year 2024_25 Semester: IV


Project Based Learning – II (CSE2PM09A / AID2PM07A)
LABORATORY WRITE UP

Experiment Number: 08
TITLE: Dynamic Programming
PROBLEM STATEMENT:
Implement 0/1 Knapsack OR Traveling Salesperson problem using Dynamic Programming

OBJECTIVE:
1. To study Dynamic Programming strategy.
2. To study algorithms for implementing 0/1 Knapsack
3. To study algorithms for implementing Traveling Salesperson problem

THEORY: //To be Written by Students // Write theory by elaborating below points


● Note on Dynamic Programming
● Elements of Dynamic Programming
● Note on 0/1 Knapsack / Traveling Salesperson problem
● Time Complexity of Different algorithms involved

IMPLEMENTATION:
● PLATFORM:
o 64-bit Open source Linux or its derivatives.
o Open Source C Programming tool like gcc/Eclipse Editor / Text Editor

● PSEUDO CODE: //To be Written by Students


● TIME COMPLEXITY: //To be Written by Students
 Find out time complexity of above operations
 Plotting of graphs for measured times Vs Input Values.

● CONCLUSION:
Thus, implemented 0/1 Knapsack OR Traveling Salesperson problem using Dynamic
Programming.

● FAQs: //To be Written by Students


 Interpret the need of Dynamic Programming over Recursion. Enlist few
applications which can be solved by using dynamic programming.

 Compare Divide & Conquer vs Dynamic Programming

 Compare Greedy method vs Dynamic Programming

● PRACTICE ASSIGNMENTS
Code-chef assignments

You might also like