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 Fundamentals of Algorithms Assignment No 01 Spring 2019 Solution & Discussion Due Date: 15-05-2019

CS502 Fundamentals of Algorithms Assignment No 01 Spring 2019 Solution & Discussion Due Date: 15-05-2019

Question No  01:   (Marks:  10)

 

The following algorithm (procedure) is computing the multiplication of two squared matrices. A[][] and B[][] are two squared matrices, Mul[][] is a square matrix which store the multiplication of A[][] and B[][]. As the matrices are squared so, “n” would be the number of columns or rows. You are required to calculate the worst case time complexity {T(n)} of this algorithm.

 

1    Matrix_Multiplication (A[][], B[][],Mul[][], int n)

 

2    Sum  = 0

3    for (int i to n)

4         for (int j to n)

5                     for (int k to n)

6                        Sum =  Sum + A[i][k] * B[k][j];

       

7         Mul[i][j] = Sum;

   

 

Note: Make sure that the alignment of each step/line is important in the algorithm, because it may indicate you that the loops are nested or in sequence.

 

Question No. 02   (Marks   10)

 

Consider the following function f(n) which represent the time complexity of an algorithm.

 

f(n)  = 2n2 + 4n + 7

 

As per the definition of Big O, we have, 0 ≤  f(n)  ≤ cg(n) , where c >0 and n ≥  n0

 

If  g(n) = n2 , find the value of c for which the upper bound cg(n)  holds.

 

 

=====================================Ended=======================================

 

For any query about the assignment, contact at CS502@vu.edu.pk

 

GOOD LUCK

+ 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: 5681

.

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

Attachments:

Replies to This Discussion

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. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

“How to Join Subject Study Groups & Get Helping Material”

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

isk solution bhe discuss krea ga yhn pa please....

*********

Koi tu solution upload kr da

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

This is just an Idea about worst case time

And this is Average case time

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

Share below link with friends for solution & Discussion.

http://bit.ly/vucodes

CS502 Assignment#01 Spring 2019 Solution 

No photo description available.

@Tariq Sir ... can we have a clear image as few of the things r not readable. 

moreover i wanted to speak to you for years now. left few msgs in inbox but never get the reply. 

i'll be grateful if can have a quick min of yours.

RSS

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

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

.