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

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the

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