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

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

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search 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

1

 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

t


n = n   


if n = 0, 1, 2

t


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

5


4 1


3

In


6


Out

2


4


5


3


1

1

3                     4

8                      6

4                     7


6

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

A


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

 

 

 

 

 

 

 

2

 

This Content Originally Published by a member of VU Students.

Views: 35

See Your Saved Posts Timeline

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>>

 

Note:-

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 .... 

RSS

Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Latest Activity

Sadia yasin replied to +·.·´¯`·.·★ $ţąяℓɨǥhţ ★·.·´¯`·.·'s discussion ENG201 - Assignment No' 2 - Due Date: May 24, 2017 in the group ENG201 Business and Technical English Writing
9 minutes ago
Muhammad Naeem joined + M.Tariq Malik's group
16 minutes ago
Muhammad Naeem replied to Marri's discussion Software Project Management Assignment # 02 Spring 2017 in the group CS615 Software Project Management
16 minutes ago
zeeshan ahmad liked rabia bashir's profile
20 minutes ago
+ HamnA (Cutie Pie) replied to +вαкнтαωαя(вѕ 8тн)'s discussion @@@@@*** Clapping For All Motooooooooooooossssssssss****@@@@@
25 minutes ago
Profile IconSadia yasin, M.Farhan Chishti and Sadaqat Ali joined + M.Tariq Malik's group
25 minutes ago
Profile IconSadia yasin and Rio Leo joined + M.Tariq Malik's group
26 minutes ago
amjad shafiq replied to Al_Habr's discussion CS502, Assignment No 2, DueDate : 23-05-2017, Total marks 25 in the group CS502 Fundamentals of Algorithms
42 minutes ago
amjad shafiq replied to amjad shafiq's discussion CS501 Assignment no. 2 Due date 23-05-2017 in the group CS501 Advance Computer Architecture
52 minutes ago
Maher Eng Shahzad Tufail Mcs liked Maher Eng Shahzad Tufail Mcs's video
52 minutes ago
+ HamnA (Cutie Pie) liked Maher Eng Shahzad Tufail Mcs's video
53 minutes ago
+ HamnA (Cutie Pie) commented on Maher Eng Shahzad Tufail Mcs's video
53 minutes ago

Member of The Month

1. HaPpY cнαη∂α (✿◠‿◠)(◉‿◉✿)

Cute Mardan ( Narshak :P), Pakistan

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

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