Given Information : The given code is: //variable declaration //matrix Int x[2][128]; int i; //variable to store sum Int sum=0; //iterate through the matrix for(i=0;i<128;i++) { //sum of matrix elements sum+= x[0][i]*x[1][i]; } Explanation: The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses. Here, size of (int) =4. Only memory accesses entries of array “x”. C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

#include int main (void) { int i, *p, count } p = &count; = 10%; for (i = 5; i >= 0; i--) { count++; (*p) ++; } printf("count return 0; = %d, Have a wonderful day.\n", count); 1. [20 pts] What is the output of the program? Please explain why. 2. [15 pts] What is the gdb command to set a breakpoint in line 6 (p = &count;)? 3. [15 pts] Explain in your own words how the [break. need to use such command? ... if expr] command works. When might you

Please run and debug the following program and answer the questions.

(OnlineGDB) #include <stdio.h>int main(void) {int a;char *s;int v0 = 4, v1 = 5, v2 = 6, v3 = 1, v4 = 2;printf("Exercise 1:\n====================\n");switch(v0) {case 0: printf("Hello October\n"); break;case 1: printf("Go Kean!\n"); break;case 2: printf("Academic Building Center \n"); break;case 3: printf("UNION \n"); break;case 4: printf("Go ");case 5: printf("Kean! \n");default: printf("Have a great semester! \n"); break;}for(a=5; a<v1; a++) {printf("Kean");}printf("\n");if (v2 == 6) {s = "Go";}else {s = "Hello";}if(v3 != v4) {printf("%s Kean!\n",s);} else {printf("%s Computer Science!\n",s);}return 0;} Assume the following codes are added between line 36 (}) and line 38 (return 0;) v0>0 ? ++v1, ++v2 : --v3; Please give the values of v0, v1, v2, v3, and v4 after this line and explain the reason. You can test the program to verify your answer if you like.

Answer 2

Question

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 3

Question

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 4

Question

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 5

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 6

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 7

Chapter 6, Problem 6.36HW

A)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 8

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 9

B)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 10

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 11

C)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 12

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 13

D)

Program Plan Intro

Given Information:

The given code is:

//variable declaration

//matrix

int x[2][128];

int i;

//variable to store sum

int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

     {

//sum of matrix elements

              sum+= x[0][i]*x[1][i];

     }

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 14

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 15

E)

Program Plan Intro

Given Information:

The given code is:

The given code is:

//variable declaration

//matrix

Int x[2][128];

int i;

//variable to store sum

Int sum=0;

//iterate through the matrix

for(i=0;i<128;i++)

{

//sum of matrix elements

sum+= x[0][i]*x[1][i];

}

Explanation:

The given array is x[2][128]. The cache is initially empty and it begins to store data from “0x0” addresses.

Here, size of (int) =4.

Only memory accesses entries of array “x”.

C arrays allocated in row-major order which means that each row is in their contiguous memory location.

Answer 16

Expert Solution & Answer

Answer 17

Expert Solution & Answer

Answer 18

Want to see the full answer?

Check out a sample textbook solution

See solution

Answer 19

Ch. 6.1 - Prob. 6.1PP Ch. 6.1 - Prob. 6.2PP Ch. 6.1 - Prob. 6.3PP Ch. 6.1 - Prob. 6.4PP Ch. 6.1 - Prob. 6.5PP Ch. 6.1 - Prob. 6.6PP Ch. 6.2 - Prob. 6.7PP Ch. 6.2 - Prob. 6.8PP Ch. 6.4 - Prob. 6.9PP Ch. 6.4 - Prob. 6.10PP

Solution Summary: The author explains that the given array is x[2][128]. The cache is initially empty and it begins to store data from "0x0" addresses.

Concept explainers

Want to see the full answer?

Chapter 6 Solutions