DESIGN AND ANALYSIS OF

ALGORITHMS
UNIT - III
(21CSC204J)
Presented by:
Dr. Juhi Singh
Assistant Professor
CSE
SRMIST ,Ghaziabad
OUTLINES
 Introduction to Dynamic Programming-
 Examples of Problems That Can Be
0/1 Knapsack Problem
Solved Using Greedy and Dynamic
Approach  Complexity Calculation of Knapsack

Problem
Huffman Coding Using Greedy Approach
 Matrix Chain Multiplication using
 Comparison of Brute Force and Huffman
Dynamic Programming
Method of Encoding
 Longest Common Sequence using
 Knapsack Problem using Greedy
Dynamic Programming
Approach
 Explanation of LCS with an example
 Complexity Derivation of Knapsack
using Greedy  Optimal Binary Search Tree using

Dynamic Programming
Tree Traversal
 Explanation of OBST with an Example
 Minimum Spanning Tree- Greedy
Kruskal’s Algorithms
 Minimum Spanning Tree- Greedy Prims
Algorithm
OUTCOME OF THIRD UNIT

 Utilize various approaches to solve greedy and dynamic algorithms.

 Analysis of greedy and dynamic algorithms.
 Apply greedy and dynamic programming techniques to solve polynomial time
problems.
Examples of Problems That Can Be Solved
Using Greedy and Dynamic Approach

( Reference notes provided)

Huffman Coding Using Greedy Approach
Comparison of Brute Force and Huffman Method of
Encoding

( Reference notes provided)

Knapsack Problem using Greedy Approach
Complexity Derivation of Knapsack using Greedy

( Reference notes provided)

Tree Traversal -- BFS
DFS
BFS and DFS Time Complexity
Minimum Spanning Tree- Greedy
Kruskal’s Algorithms
Minimum Spanning Tree- Greedy Prims
Algorithm
0/1 Knapsack
Matrix Chain Multiplication using
Dynamic Programming
Matrix Chain Multiplication using Dynamic Programming
Longest Common
Subsequence
Optimal Binary Search Tree
Thank You