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.
CS502 Assignment No. 02 Solution & Discussion Due Date: Dec 07, 2015
Assignment No. 02 CS502: Fundamentals of Algorithms Due Date:07/12/2015 Instructions Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
Objective
The objective of this assignment is to enable students:
Submission
You are required to submit your solution through LMS as MS Word document.
For any query about the assignment, contact at CS502@vu.edu.pk GOOD LUCK


Question 1:
Consider the following recursive algorithm for computing the sum of the first n squares: Sum(n) = 12 + 22 + . . . + n2.
Algorithm: SUM(n) if n = 1 return 1 else return SUM(n − 1) + n ∗ n
Write recurrence relation for above algorithm and solve it using Iteration Method.
Question 2:
In Divide and conquer strategy, three main steps are performed:
Write an algorithm to find minimum number from a given array of size ‘n’ using divide and conquer approach.


Lectures Covered: This assignment covers first 15 Lectures. Deadline: Your assignment must be uploaded/submitted at or before 07 Dec, 2015. 
Tags:
+ 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?.
+ 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)++msn .fb sy mera answr chori kar liya _ .. ye lo complete solution :P duaon mein yaad rakhna
God Bless u Dear
please koi ye to btyn na knsa solution kis question ka hy???????
plzzzzzzzzzz jaldi sy bta dyn knsa solution kis question ka hy???
or knsa solution theek hy???
part 1 ist ka ....
auer part 2 scnd ka .........scnd ka answr mjhe cnfrm nhe :)
KYA YE THEAK HEIN ??????PLEASE TELL ME
Assignment No. 02
ID=MC140401807
Question 1:
Consider the following recursive algorithm for computing the sum of the first n squares:
Sum(n) = 1^{2} + 2^{2} + . . . + n^{2}.
Algorithm: SUM(n)
if n = 1 return 1
else return SUM (n1) + n _{*} n
Write recurrence relation for above algorithm and solve it using Iteration Method.
Answer:
Iteration method of power 2 k=log n
T(n) = 2kT (n/(2k)) + (n+n+n+....+n)
= n + n log n
Question 2:
In Divide and conquer strategy, three main steps are performed:
Write an algorithm to find minimum number from a given array of size ‘n’ using divide and conquer approach.
Answer: Denoting S(n) the sum of the first n cubes, S(n) must be a polynomial of the fourth degree in n, let
S(n) = an^4+bn³+cn²+dn
This is because
1) S(0)= 0, so there is no independent term
2) When computing S(n)S(n1), which must equal n³, you get a polynomial of the third degree, by cancellation of the quartic term:
S (n)S(n1) = a(n^4(n1)^4)+b(n³(n1)³)+c(n²(n1)²)+d(n(n1)).
Developing and simplifying
a(4n³6n²+4n1)+b(3n²3n+1)+c(2n1)+d = n³.
Let us identify the coefficients.
n³: 4a = 1
n²: 6a + 3b = 0
n: 4a  3b + 2c = 0
1:  a + b – c + d = 0
Solving this triangular system is straightforward:
a= 1/4
b= 1/2
c= 1/4
d= 0
So,
S(n) = (n^4+2n³+n²)/4 = n²(n+1)²/4.
YE theak hy ya galat ?
Part1
T(n)=T(n1)+n*n as we know that T(n1)=T(n2)+n*n so we put this value
T(n)=T(n2)+n*n+n*n =T(n2)+2(n*n)
T(n)= T(n2)+2(n*n) T(n2)=T(n3)+n*n so we put this value
T(n)= T(n3)+2(n*n)+n*n= T(n3)+3(n*n)
T(n3)+3(n*n) T(n3)=T(n4)+n*n so we put this value
T(n)=T(n4)+3(n*n)+n*n=T(n4)+4(n*n)
..........
T(n)= T(nk)+k(n*n)
If we set n=k
Then
T(n)= T(nn)+n(n*n)=n^3
Part2:
SELECT(Array A,int p ,int r,int k=1)
if(p=r)
then return A[p]
else x CHOOSE_PIVOT(A,p,r)
q PARTITION (A,p,r,x)
rankx qp+1
if k= rankx
then return x
if k< rankx
then return SELECT(A, p ,q1, k)
© 2019 Created by + M.Tariq Malik. Powered by
Promote Us  Report an Issue  Privacy Policy  Terms of Service
VU Students reserves the right to delete any profile, which does not show any Activity at site nor has not any activity more than 01 month.
We are usergenerated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List  Moderators Group
All Members  Featured Members  Top Reputation Members  Angels Members  Intellectual Members  Criteria for Selection
Become a Team Member  Safety Guidelines for New  Site FAQ & Rules  Safety Matters  Online Safety  Rules For Blog Post