Answer problem 2 Course Name : Algorithms Problem 1 Two Algorithms: 1. Greedy Algorithms (Fractional Knapsack, Huffman coding) 2. Dynamic Programming (Longest Common Subsequence, Matrix chain...

Answer problem 2

Course Name: Algorithms

Problem 1

Two Algorithms:

1. Greedy Algorithms (Fractional Knapsack, Huffman coding)

2. Dynamic Programming (Longest Common Subsequence, Matrix chain multiplication)

Problem 2

State any of the two Algorithms that you listed in Problem 1.

Problem 3

Discuss the complexity of the two Algorithms mentioned in Problem 2.

Problem 4

Compare between the Algorithms that you discussed in Problem 3 in terms of time and space complexity.