CS502 Assignment No. 02 Solution & Discussion Due Date: Dec 07, 2015
CS502  Fundamentals of Algorithms Assignment No. 02 Solution Fall 2015 Due Date Dec 07, 2015
Assignment No. 02 Semester: Fall 2015
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:
 The assignment is submitted after due date.
 The submitted assignment is other than .doc file.
 The submitted assignment does NOT open or file is corrupted.
 The assignment is copied (from other student or ditto copy from any other source).
Objective
The objective of this assignment is to enable students:
 Write and solve recurrence relations of recursive algorithms using iteration method
 Design algorithm using Divide and conquer approach
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:
 1. Divide: Divides the problem into a small number of pieces
 2. Conquer: Solves each piece by applying divide and conquer to it recursively
 3. Combine: Combines/merges the pieces together into a global solution.
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: