CS502 Assignment No. 02 Solution & Discussion Due Date: Dec 07, 2015
Assignment No. 02
CS502: Fundamentals of Algorithms
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
The objective of this assignment is to enable students:
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
Consider the following recursive algorithm for computing the sum of the first n squares:
Sum(n) = 12 + 22 + . . . + n2.
if n = 1 return 1
else return SUM(n − 1) + n ∗ n
Write recurrence relation for above algorithm and solve it using Iteration Method.
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.
Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....
have you complete your assignment???
koi tou solution banaooo
last dat e qareeb hy
luqman bhi ye question 1 ha ya 2
ye example hai handouts main
haya kn c example hai j?
handouts main di v hai but wo easy example hai assignment main jo hai wo solve e nai ho rhi
kis pg pr
plzzzzzz any one???