1. Unit-4: Dynamic Programming
Contents
1. Longest common sub-sequence and Theory, example, algorithm, complexity 2. Optimal Binary Search Tree: Theory, example, application, algorithm, complexity 3.Minimum Edit Distance: Theory, example, application 4.Travelling Salesman problem: Theory, example, application 5.Multi-stage graph: Theory, example, algorithm, application, complexity 6.Maximum Sum Rectangle in 2D array: Theory, example [Assignment on case study]

2. Prepare Multistage Graph Principle, Application Example Algorithm
Solve:

3. Prepare: Travelling Salesman Problem Principle Example Applications
Complexity equation of solution - 9 6 12 4 5 8 10 11

4. Prepare Longest Common Subsequence Principle
Shortest Common Subsequence
Example
Algorithm
Complexity
Solve
String A = G A T T A C A
String B = G T A A T C T A A C

5. Prepare Optimal Binary Search Tree Principle Example Applications
Solve
Keys K0 K1 K2 K3 K4 K5 Pi
0.15
0.10
0.05 Qi

6. Prepare Minimum distance String Editing Principle Algorithm
Application
Solve
String 1: Singnatre
String 2: Signature

7. Prepare Maximum sum 2D rectangle problem Logic Application Example
Solve -9 5 -2 10 14 3 6 2 -5 -1 4