[Solved]Question 1 Sorting Algorithms 20 Pts 1 Consider Matrix Multiplicationcomputation Program C Q37046284
Question 1: Sorting Algorithms (20 pts)
1. Consider a matrix multiplicationcomputation program C =B*(A
+D) where A, B, C and D are (nxn) two dimensional matrices.
2. The program is executed on a computer with the following
characteristics:
a. CPU time for one multiplication is 100 microseconds
b. CPUT time for one addition is 5 microseconds
c. The memory reference time for either read or write is 200
microseconds
3.
Let n=1000, what is the total time required to perform the
multiplication. Assume that all data is located in memory(5)
4.
What is the space complexity for this problem (5)
5. Now assume that you run the program on a computer withthe
following characteristics
a. CPU time for one multiplication is 500 microseconds
b. CPUT time for one addition is 1 microseconds
c. The memory reference time for either read or write is 100
microseconds
6.
Let n=1000, what is the total time required to perform the
multiplication. Assume that all data is located in memory(5)
7.
What is the space complexity for this problem (5)
Expert Answer
Answer to Question 1: Sorting Algorithms (20 pts) 1. Consider a matrix multiplicationcomputation program C = B*(A +D) where A, B, … . . .
OR
