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

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 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: 17810

.

+ 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

ye kis question ka solution hy /

koiiiiiiiiiiiiiiiiiiiii hhhhhhhhhhhhhhhhhh

y thk h??

tehk he hoge ab to submit be krva di

pata nh thk h b ya nh

kaun si submit ki share hi kar do

submit karain assignment sol

Y LO 

Attachments:

ya corrct h ya phly wali

Slove of Question 2 divide and conquer technique

Algorithm to find minimum number

If (p=r)        // here we supposing n is equal to one

Then return A[p]

Else <-- Choose_Pivot (A, p, r)     //if n is not equal to 1 then select a pivot

q <-- Partition (A, p, r, x)      ...................//then divide the array 

if rank_x= 1 ................../// if the rank of pivot element after partition is 1

then return x   ... //then this pivot element is the minimum number in array

else //if rank_x > 1           //// otherwise proceed recursively                      

then return Select( A, p, q-1, 1)

thanks to zain in for guidance

RSS

Latest Activity

+ ! ! ! ! ᎠixieᎠuຮt꧂ liked + Iuuoɔǝut+'s blog post The End Is Not Near, But If An 'Insect Apocalypse' Ever Happens, How Would We Know?
5 minutes ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked moniba hussain's blog post love
5 minutes ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked moniba hussain's blog post fun
5 minutes ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked +¢αяєℓєѕѕ gιяℓ's discussion zevar Mard Pr Haram hai xD
5 minutes ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked +¢αяєℓєѕѕ gιяℓ's discussion xD.........................پرانی محبوبہ کے نام
5 minutes ago
+ ! ! ! ! ᎠixieᎠuຮt꧂ liked +¢αяєℓєѕѕ gιяℓ's discussion xD.........................پرانی محبوبہ کے نام
5 minutes ago
彡JK彡 ❤️ replied to + M.Tariq Malik's discussion کون ہوں مجھ کو بتایا جائے - گر نہ مانوں تو منایا جائے
1 hour ago
彡JK彡 ❤️ liked + M.Tariq Malik's discussion کون ہوں مجھ کو بتایا جائے - گر نہ مانوں تو منایا جائے
1 hour ago
彡JK彡 ❤️ liked + M.Tariq Malik's discussion Follow the Main Forum & Study Groups New Added Discussions at Your Mail Address
1 hour ago
彡JK彡 ❤️ replied to + Iuuoɔǝut+'s discussion STORY OF BLIND LOVE
1 hour ago
DON DON updated their profile
2 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked Whispering Soul's discussion "Izat" do trfa chez hai..
2 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion کون ہوں مجھ کو بتایا جائے - گر نہ مانوں تو منایا جائے
2 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion Follow the Main Forum & Study Groups New Added Discussions at Your Mail Address
2 hours ago
+ ! ! ! ! ! ! ! ! ! AG liked + M.Tariq Malik's discussion غیر پھر غیر، درگزر کر دے - کون روکے زبان اپنوں کی
2 hours ago
+"Khwab Zaadi"+ joined + M.Tariq Malik's group
3 hours ago
+"Khwab Zaadi"+ joined + M.Tariq Malik's group
3 hours ago
+"Khwab Zaadi"+ joined + M.Tariq Malik's group
3 hours ago
+"Khwab Zaadi"+ liked +"Certified Gangster"++'s discussion For all female friends
3 hours ago
+AAg❤️ replied to +"Certified Gangster"++'s discussion For all female friends
3 hours ago

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

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