The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
This assignment is about the following algorithm, which multiplies two square matrices A and B to produce a new square matrix C. Each matrix has size n × n. The algorithm uses a notation similar to that of the Rosen text.
1 for i := 1 to n
2 for j := 1 to n
3 cij := 0
4 for k := 1 to n
5 cij := cij + aik × bkj
1. (5 points.) Suppose that a primitive operation is either an assignment (:=), an addition (+), or a multiplication (×). How many primitive operations does the algorithm perform? You must count only the primitive operations in lines 3 and 5.
2. (5 points.) Prove that the algorithm performs O(n3) primitive operations. You must find constants C and k according to the definition of O on page 205 of the Rosen text.
3. (10 points.) Prove that the algorithm performs more than O(n) primitive operations. You must use the definition of O on page 205 of the Rosen text.
*Big-O definition (Page 205):
I1145224.pdf
Let f and g be functions from the set of integers or the set of real numbers to the set of real numbers. We say that f (x) is O(g(x)) if there are constants C and k such that
|f (x)| ≤ C|g(x)|
whenever x > k. [This is read as “f (x) is big-oh of g(x).”]
-----------