Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community
Ask the community for help and clear up your study doubts
University Rankings
Discover the best universities in your country according to Docsity users
Free resources
Our save-the-student-ebooks!
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Dynamic Programming and Backtracking Algorithms, Study notes of Design and Analysis of Algorithms
Two algorithms: the 0-1 knapsack using dynamic programming and the backtracking algorithm for the N-Queens problem. The former is based on a recursive formula and is used to solve the knapsack problem. The latter is a decision-based method used to find solutions for problems such as the N-Queens and the Graph Coloring problems. The document also includes an example of the Subset Sum problem and its solution using dynamic programming. The algorithms are presented in a concise and technical way, with little explanation or context.
Typology: Study notes
2022/2023
1 / 29
This page cannot be seen from the preview
Don't miss anything!
