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.