Question: #include #include #include #define MIN _ DIM _ POWER 3 #define MAX _ DIM _ POWER 1 0 #define FALSE 0 #define TRUE 1 void

#include
#include
#include
#define MIN_DIM_POWER 3
#define MAX_DIM_POWER 10
#define FALSE 0
#define TRUE 1
void init(const int dim, int * const m){
for (int i =0; i < dim * dim; ++i){
m[i]= rand()%20;
}
}
void print(const int dim, const int * const m){
for (int i =0; i < dim; ++i){
for (int j =0; j < dim; ++j){
printf("%d\t", m[i * dim + j]);
}
printf("
");
}
printf("
");
}
void multiply(const int dim, const int * const a, int * const b, int * const c){
for (int i =0; i < dim; ++i){
for (int j =0; j < dim; ++j){
int sum =0;
for (int k =0; k < dim; ++k){
sum += a[i * dim + k]* b[k * dim + j];
}
c[i * dim + j]= sum;
}
}
}
void transpose(const int dim, int * const m){
for (int i =0; i < dim; ++i){
for (int j =0; j < i; ++j){
int tmp = m[i * dim + j];
m[i * dim + j]= m[j * dim + i];
m[j * dim + i]= tmp;
}
}
}
void multiply_transpose(const int dim, const int * const a, const int * const b_t, int * const c){
for (int i =0; i < dim; ++i){
for (int j =0; j < dim; ++j){
int sum =0;
for (int k =0; k < dim; ++k){
sum += a[i * dim + k]* b_t[j * dim + k];
}
c[i * dim + j]= sum;
}
}
}
void transpose_and_multiply(const int dim, const int * const a, int * const b, int * const c){
transpose(dim, b);
multiply_transpose(dim, a, b, c);
}
int verify(const int dim, const int * const c1, const int * const c2){
for (int i =0; i < dim * dim; ++i){
if (c1[i]!= c2[i]){
return FALSE;
}
}
return TRUE;
}
struct timeval run_and_time(
void (*mult_func)(const int, const int * const, int * const, int * const),
const int dim,
const int * const a,
int * const b,
int * const c
){
struct timeval start, end;
gettimeofday(&start, NULL);
mult_func(dim, a, b, c);
gettimeofday(&end, NULL);
if (end.tv_usec < start.tv_usec){
end.tv_sec--;
end.tv_usec +=1000000;
}
end.tv_sec -= start.tv_sec;
end.tv_usec -= start.tv_usec;
return end;
}
void run_test(const int dim){
int *a = calloc(dim * dim, sizeof(int));
int *b = calloc(dim * dim, sizeof(int));
int *c1= calloc(dim * dim, sizeof(int));
int *c2= calloc(dim * dim, sizeof(int));
init(dim, a);
init(dim, b);
printf("Matrix A:
");
print(dim, a);
printf("Matrix B:
");
print(dim, b);
printf("Running standard multiplication...
");
struct timeval standard_time = run_and_time(&multiply, dim, a, b, c1);
printf("Standard multiplication: %ld seconds, %d microseconds
", standard_time.tv_sec, standard_time.tv_usec);
printf("Running multiplication with transpose...
");
struct timeval transpose_time = run_and_time(&transpose_and_multiply, dim, a, b, c2);
printf("Multiplication with transpose: %ld seconds, %d microseconds
", transpose_time.tv_sec, transpose_time.tv_usec);
printf("Results agree. %s
", verify(dim, c1, c2)? "Standard multiplication" : "Multiplication with transpose");
free(a);
free(b);
free(c1);
free(c2);
}
int main(){
for (int power = MIN_DIM_POWER; power <= MAX_DIM_POWER; ++power){
int dim =1<< power;
printf("Running test for dimension: %d
", dim);
run_test(dim);
}
return EXIT_SUCCESS;
} edit this c code that represents matrix multiplication to have this sample run ./pa5.c
Results agree.
Standard multiplication: 0 seconds, 4 microseconds
Multiplication with transpose: 0 seconds, 4 microseconds
Results agree.
Standard multiplication: 0 seconds, 39 microseconds
Multiplication with transpose: 0 seconds, 24 microseconds

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Accounting Questions!

Q:

convert the following c + + code to AVR Assembly code: #include #include #include / / Pin Definitions #define START _ PAUSE _ BUTTON 1 #define STOP _ BUTTON 0 #define RGB _ RED _ PIN 2 #define RGB _...

Q:

to be completed in the C language. I attached the code base which should be modified as detailed in the instructions. please show all your work and provide detailed explanations. finna learn #include...

Q:

In c++ Do not change the main or tic-tac-toe.h. file only work were it says "TODO" and you're allowed to add more libraries if needed Main: #include "tic-tac-toe.h" int main(int argc, char** argv){...

Q:

#include "application.h" #include int main() { Application app; app.init(); while(app.getState() == Application::STATE_RUNNING) { app.draw(); app.setUserInput(_getch()); app.update(); }...

Q:

Help me to understand this code, if u dont mind explain the whole code,if not just explain the interface part and LQueue part bcz i didnt understand that part based of this output Code: Main.cpp...

Q:

Could you help me with this? This is C++. I really need your help please This looks quite long, but I just need a Time.cpp Thank you Project Implementation notes: Very Important, read carefully All...

Q:

Please I need help converting the following C++ code to java code. #include #include #include #include #include using namespace std; #include "State.h" #include "Stat.h" const int DISPLAYED = 15; //...

Q:

Please SOLVE C++ ,almost done just need iterators, namespace, and display lab The universities really liked the ability to bundle the information for the labs, but now there is some consideration...

Q:

Store only one integer in SDate class-the value of the computed serial date. When writing the implementation, call existing serial date functions to perform all low-level serial Julian date...

Q:

Assignment 2 Due February 7 Overview In this assignment, you will store more information for the game board. Instead of just a money value, each grid cell on the board will have a tile with a genus,...

Q:

If the sum of the elements of each row of a square matrix is k, then the sum of the elements in each row of the inverse matrix is 1/k.

Q:

At its best possible output level, a firm has total revenue of $3,500 per day and total cost of $7,000 per day. What should this firm do in the short run if? a. The firm has total fixed costs of...

Q:

Which method charges the same depreciation amount each year of the asset's useful life? ( 2 points ) a ) Declining Balance Method b ) Double Declining Balance Method c ) Straight - Line Method d )...

Q:

Diameters data frame of the first sample (showing only the first five observations) diameters 0 1.99 1 1.56 2 1.89 3 2.74 4 1.81 Diameters data frame of the second sample (showing only the first five...