We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ 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

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. 1.      Divide: Divides the problem into a small number of pieces
  2. 2.      Conquer: Solves each piece by applying divide and conquer to it recursively
  3. 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. 

+ 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?


See Your Saved Posts Timeline

Views: 17859

.

+ 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)

Replies to This Discussion

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???

???????

solution ?

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

any one here to discuss

plzzzzzz any one???

RSS

Latest Activity

+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
2 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
2 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
2 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
2 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
3 minutes ago
+M.Tariq Malik replied to +M.Tariq Malik's discussion STA408 Design and Analysis of Experiments GDB Spring 2020 Solution & Discussion Last Date: 07-06-2020 in the group STA408 Design and Analysis of Experiments
3 minutes ago
Profile IconJunaid Khan, seoexpert2k20, binyameen and 4 more joined Virtual University of Pakistan
4 minutes ago
Maham Raza. and Volunteer are now friends
10 minutes ago
Nishal Jafry liked +M.Tariq Malik's group PSY404 Abnormal Psychology
17 minutes ago
Nishal Jafry liked +M.Tariq Malik's group PSY403 Social Psychology
18 minutes ago
Nishal Jafry joined +M.Tariq Malik's group
18 minutes ago
Nishal Jafry liked +M.Tariq Malik's group MCM301 Communication skills
22 minutes ago

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.