Design & Analysis of Algorithms

Implement the following algorithms: Ø The Longest Common Subsequence Problem Ø Matrix Chain Multiplication Ø The All-Pairs Shortest Path Problem Ø Knapsack problem It is required that the Dynamic Programming algorithms are implemented for this purpose. The objective of the project is to implement and have an analysis for the followings: q Real Time using Dynamic Programming Approach q Time using Brute-Force Method (wherever applicable) IMPORTANT: è Use Java programming language for implementation. è Program should be well documented. è Program should be error-free. è The program should be written in such a way that the user has the freedom to input a desired input data. è Program output should be clearly displayed. --------------------------------------------------- ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Deliverables must be in ready-to-run condition, as follows? (depending on the nature? of the deliverables): a)? For web sites or? other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment. b) For all others including desktop software or software the buyer intends to distribute: A software? installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request. 3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement). ## Platform windows