Sunday 7 June 2015

CS702: Advanced Algorithm Analysis and Design Assignment No.2 MS(CS), Spring 2015 Due Date: 13thJune, 2015

CS702: Advanced Algorithm Analysis and Design

Assignment No.2 MS(CS), Spring 2015 Maximum Points: 50

Due Date: 13thJune, 2015 Instructions

The purpose of this assignment is to give you hands on practice. It is
expected that students will solve the assignments themselves. Following
rules will apply during the evaluation of assignment.
v Cheating from any source will result in zero marks in the
assignment.
v Any student found cheating in any of the two assignments submitted
will be awarded "F" grade in the course.
v No assignment after due date will be accepted
Question No. 1 (25Points)


For the sequence of matrices, given below, compute the order of the product, A1.A2.A3.A4, in such a way that minimizes the total number of scalar multiplications, using Dynamic Programming.

Order of A1= 40 x 50
Order of A2= 50 x 100
Order of A3= 100 x 20
Order of A4= 20 x 80

Question No. 2 (25 Points)


Use Dynamic Programming to find an optimal solution for the 0-1 Knapsack problem.
item weight value knapsack capacity W = 11
1 1 1
2 2 6
3 5 18
4 6 22
5 7 28


Etec Learning Institute
Quality is everything we do
Vu Final Project Help And Guidance
project with Full Tutorial and Low Cost.
Cell no: 03103163233
Skype: Eteconline786
email: vuprojectshelp@gmail.com

No comments:

Post a Comment