We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

CS702 - Advanced Algorithms Analysis and Design Assignment No. 2 Solution and Discussion Spring 2017 Due Date: May 25, 2017

CS702 - Advanced Algorithms Analysis and Design Assignment No. 2 Solution and Discussion Spring 2017 Due Date: May 25, 2017


 Virtual University of Pakistan

Spring 2017

Answer the following questions in your own words. Plagiarism will be checked for each question. Marks will be awarded on the basis of answer and plagiarism report.




Question 1                                                                                                            (15 Marks)

Consider the recurrence


n = n   

if n = 0, 1, 2


n  = 6.tn-1 - 11.t n-2  +  6.t n-3       otherwise

Find the general solution of the recurrence above.

Question 2                                                                                                            (15 Marks)

Prove that 5.n2  + 10.n + 16         Î Q(n2 )

Question 3                                                                                                            (20 Marks)

There are two assembly lines, as shown in the diagram below, each with 6 stations. The auto is required to go through from all of these 6 stations from left to right. Nodes represent stations. The assembly time at each station is shown at each node. The entering and exit times for an auto are also given. The transfer time is represented at the edges when an auto moves to next station on a different line. There is no transfer time if it stays on the same line. Determine which stations to choose from lines 1 and 2 to minimize total time through the factory. Also compute the optimal value in terms of time. Use Dynamic

Programming Approach. You need to calculate    f

optimal path.                                     i[j], li[j], f*, l* and the

5                     5 3                                         6                     8                    7

3                                                                                                                                            3


4 1











3                     4

8                      6

4                     7


For  the  sequence  of  matrices,  given  below,  compute  the  order  of  the  product,


1.A2.A 3.A 4, in such a way that minimizes the total number of scalar multiplications,

using Dynamic Programming.

Order of A

1  =  20 x 10

Order of A

Order of A2 =  10 x 30

Order of A

3  =  30 x 15

4  =  15 x 25










+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

See Your Saved Posts Timeline

Views: 427


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>



For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.


.•°How to Download past papers from study groups°•.


Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 


© 2020   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service