Software Engineering (EEN 511 - Spring 2004)
The combinations Problem
The KnapSack Problem (Solved by Dynamic Programming)
The KnapSack Problem (Solved by Brute Force- all possible combinations)
The Minimum Edit Distance Problem
The Minimum Spanning Tree Problem
The Shortest Path Problem