Weight. 2. A BMI (body mass index) is roughly weight over height square (BMI Height Write Assembly code to calculate average BMI of N students. Relevant data is stored in memory as shown in the example below. Address 10 has the total number of students (N) followed by N weights and heights. Store the computed average BMI at the address 70. For example, if N = 2, the memory contents will be as follows: 0 1 |2 |3 | 4 5 6 10 02 96 05 5A | 06 There are 2 records. Weight and height of the 1s* person is 96 and 05 respectively. Similarly, 5A and 06 are the weight and height of the second person. Assume decimal points are ignored and the average will be a rounded integer value. All divisions are integer divisions as well. Please use the Instruction Set of the simulator discussed in class. (http://www.softwareforeducation.com/sms32v50/sms32v50_manual/245-IsetSummary.htm)

Weight. 2. A BMI (body mass index) is roughly weight over height square (BMI Height Write Assembly code to calculate average BMI of N students. Relevant data is stored in memory as shown in the example below. Address 10 has the total number of students (N) followed by N weights and heights. Store the computed average BMI at the address 70. For example, if N = 2, the memory contents will be as follows: 0 1 |2 |3 | 4 5 6 10 02 96 05 5A | 06 There are 2 records. Weight and height of the 1s* person is 96 and 05 respectively. Similarly, 5A and 06 are the weight and height of the second person. Assume decimal points are ignored and the average will be a rounded integer value. All divisions are integer divisions as well. Please use the Instruction Set of the simulator discussed in class. (http://www.softwareforeducation.com/sms32v50/sms32v50_manual/245-IsetSummary.htm)

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 12VE

See similar textbooks

Similar questions

In C Language Please
15. The only way to access data stored in heap memory is through pointer variables malloc () allocation tables а. b. С. d. a buffer memory
Segmentation: Select all of the following statements that are true. In segmentation, a logical address always has a length of 32 bit. In order to translate logical into physical addresses, the memory management unit uses the segment part of the logical address to determine the start address in the segment table and adds the offset to this to get the physical address. In segmentation, the logical address consists of a segment part and an offset. The segment length is limited by the maximum possible segment number. When applying segmentation, processes are only allowed to access the memory within their segments. Segments can be assigned access rights and privilege levels.
in c++ 5. Assume you have given an array A[15][20]. Each element needs 'W' bytes of storage. If the address of A[6][8] is 4440 and the base address at A[1][1] is 4000, find the width 'W' of each cell in the array A when the array is stored as Column Major Wise.
Software: sim8085 Write 8085 microprocessor code and attach output screenshot.
c++
Computer science
Using pointers create a c program with a function that asks for a maximum number of inputs and counts how many even numbers are there in the array. Example: Enter max inputs: 3 Enter input 1: 561 Enter input 2: 780 Enter input 3: 943 Even count: 1 Even numbers: 780 Address: x
The program below uses pointer arithmetic to determine the size of a 'char' variable. By using pointer arithmetic we can find out the value of 'cp' and the value of 'cp+1'. Since cp is a pointer, this addition involves pointer arithmetic: adding one to a pointer makes the pointer point to the next element of the same type. For a pointer to a char, adding 1 really just means adding 1 to the address, but this is only because each char is 1 byte. Compile and run the program and see what it does. Write some code that does pointer arithmetic with a pointer to an int and determine how big an int is. Same idea – figure out how big a double is, by using pointer arithmetic and printing out the value of the pointer before and after adding 1. What should happen if you added 2 to the pointers from exercises 1 through 3, instead of 1? Use your program to verify your answer #include <stdio.h>int main( ) { char c = ‘Z’; char *cp = &c; printf("cp is 0x%08x\n", cp); printf("The character…
trtjhrtjhrthrt
The code box below defines a variable route as a list of directions to navigate a maze. Each instruction is one of the following four basic commands: • higher. move one step in the positive y direction • lower: move one step in the negative y direction • left: move one step in the negative x direction right: move one step in the positive x direction ● Define a function move that takes two arguments, a location (as a tuple of x and y coordinates) and an instruction (higher, lower, left, right) as a string. Given the provided location, it should return the new location (as a tuple of x and y coordinates) when following the specified instruction. If the instruction is invalid, the old location should be returned. Use the function move to determine the final position when starting from the point (-2, -1) and following all instructions in the list route. Assign this final position to the variable final_location. Reset answer 1 route = ['right', 'higher', 'left', 'lower', 'higher', 'left',…
Write program segments that perform the operation C C+ A x B using each of the instruction classes indicated in Exercise 1 above. Assume that A, B, and C are memory 3. addresses. lleuing data Lin the