Computer Systems: A Programmer's Perspective (3rd Edition)
Computer Systems: A Programmer's Perspective (3rd Edition)
3rd Edition
ISBN: 9780134092669
Author: Bryant, Randal E. Bryant, David R. O'Hallaron, David R., Randal E.; O'Hallaron, Bryant/O'hallaron
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
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.

Blurred answer
Students have asked these similar questions
Please solve this problem in emu8086 microprocessor in Assembly Language. Please solve properly, will upvote after getting proper solve Read 10 inputs (range 0-9) from the user and store them in an array. Find the position (or index) of the maximum and minimum values in the array, and swap them (move the biggest element to the position of the smallest, and move the smallest element to the position of the biggest), and print that again. If there are multiple maximum or minimum numbers, then choose the first occurrence, values. Your program should be able to handle negative values. Explanation: Here from the given input we see that 9 is the maximum number and it has occurred twice, first in the 2nd index and again in the 5th index. Similarly here 3 is the least and it also has appeared twice, once in the 3rd index and again in the 6th index. So we swap 9 and 3 from the 2nd and 3rd indices and then after swapping, print the new array. Input: 7935935874 Output: 7395645874 Comment:Range 0…
80x86 Intel Assembly language Write an 80x86 Intel assembly language program: Declare two integer arrays and initialize the first one with 7, 6, 5, 4 and 3. Initialize the second one with 3, 6, 9, 10, 15 Declare the third array of the same size but do not initialize. Your program must initialize ESI and EDI to have the addresses of the array1 and array2 respectively. Use EBX and place the address of the third array in that register. Use these registers to add the first element of the first array to the first element of the second array and place the result in the third array. Updated the values of these registers so all of them refer to the next location.
Microprocessor 8086 write An array called (A) has 300 unsigned byte numbers (chose your Owen data), write only one assemble to the following1-store the Maximum number of (A) in physical address AB200h. 2- store the Minimum number of (A) in the physical address CD100h. 3-rearrange the array given (A) ascending and save the new array in the memory starting at 3050e 4-save only the maximum odd number in the logical address 5200:0350
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education