Scribd
Upload
9 views1 page

Addtional PGM DP BK

The document outlines various algorithmic problems categorized under Dynamic Programming and Backtracking. It lists specific examples such as Fibonacci numbers and the 0-1 Knapsack Problem for DP, and the Knight’s tour problem and Rat in a Maze for Backtracking. Additional problems mentioned include the m Coloring Problem and Hamiltonian Cycle.

Uploaded by

suganya.cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views1 page

Addtional PGM DP BK

The document outlines various algorithmic problems categorized under Dynamic Programming and Backtracking. It lists specific examples such as Fibonacci numbers and the 0-1 Knapsack Problem for DP, and the Knight’s tour problem and Rat in a Maze for Backtracking. Additional problems mentioned include the m Coloring Problem and Hamiltonian Cycle.

Uploaded by

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

Dynamic Programming (DP) Problems

 Fibonacci numbers

 0-1 Knapsack Problem

Backtracking Algorithm:

 The Knight’s tour problem

 Rat in a Maze

 m Coloring Problem

 Hamiltonian Cycle

You might also like