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) = 2n^{2} + 4n + 7
As per the definition of Big O, we have, 0 ≤ f(n) ≤ cg(n) , where c >0 and n ≥ n_{0}
If g(n) = n^{2} , 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
Tags:
Kindly share once you complete it
CS502 Assignment Solution
is it correct?
CS502 Assignment#01 Spring 2019 Solution
CS502 Assignment#01 Some more ideas solution
CS502 Assignment 1 Solution
wrong solution
correct solution
kindly confirm kren kon sa solution correct hy?
© 2021 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We are user-generated contents site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post