We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ 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 Assignment No 02 Solution & Discussion Due Date: Dec 10, 2016
CS702 - Advanced Algorithms Analysis and Design Assignment No. 2 Solution Fall 2016 Due Date: Dec 10, 2016
CS702: Advanced Algorithm Analysis and Design
Assignment No.2 MS (CS), Fall 2016 Maximum Points: 50
Due Date: 10th December, 2016
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
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 (25 Points)
For the sequence of matrices, given below, compute the order of the product, A1.A2.A3.A4, A5, A6 in such a way that minimizes the total number of scalar multiplications, using Dynamic Programming.
Order of A1 = 30 x 35
Order of A2 = 35 x 15
Order of A3 = 15 x 5
Order of A4 = 5 x 10
Order of A5 = 10 x 20
Order of A6 = 20 x 25
Question No. 2 (25 Points)
a) Prove that 5.n2 + 10.n + 16 Î Q(n2)
b) Prove that 2.n3 + 3.n + 10 Î O(n4)
.+ 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)
need cs702 & 710 Assignment solution, plz
please check give me improvement idea
bhai koi to btaye k shafique ka solution thek hai k nhe?
Shafique bhai ap k method tu theek lgta ha mjh. according to my knowledge ur solution is right.
Q No. is from the book of Introduction to algorithms 3rd Edition by T.H. Cormen, C.E. Leiserson ....... on page No. 376 and in 2nd Edition page No 337
Muhammad Shafique now you are correct
the idea of Q.1 is now absolutely right......