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
Assignment No. 02, Semester: Spring 2013, CS502Fundamentals of Algorithms last date 15/05/2013 Lectures Covered: 7 to 15
Objective To solve Recurrence relations using Iteration method.
Uploading instructions: Please view the Assignment Submission Process document provided to you by the Virtual University for uploading assignments.
Rules for Marking: It should be clear that your assignment will not get any credit if:
(Strict disciplinary action will be taken in this case).

Tags:
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.
= 4T(n/4) + n + n
= 4(2T(n/8) + n/4) + n + n
= 8T(n/8) + n + n + n
= 8(2T(n/16) + n/8) + n + n + n
= 16T(n/16) + n + n + n + n
If n is a power of 2 then let n = 2k or k = log n.
T(n) = 2kT(n/(2k)) + (n + n + n + · · · + n)  {z }
k times
= 2kT(n/(2k)) + kn
= 2(logn)T(n/(2(logn))) + (log n)n
= 2(logn)T(n/n) + (log n)n
= nT(1) + n log n = n + n log n
App ny question py thora gooor kia ,..k last py n+n nai ha...last py n^2 ha. So insecond step what will be correct T(n) = 4(2T(n/8) + n^2/4) + n^2 OR T(n) = 4(2T(n/8) + (n/4)^2) + n^2.
please read carefully page no:31 from handout to solve the question
mobeen hasan thanks
see the first four pages of the file to solve the assignment question
BFSS gud keep it up & thanks for sharing
Note for All Members: You don’t need to go any other site for this assignment/GDB/Online Quiz solution, Because All discussed data of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
BFSS sis. if you have done then just share ur answer vid me plz??
thanks
how you do it
© 2014 Created by M.Tariq Malik.
Promote Us  Report an Issue  Privacy Policy  Terms of Service