subject: microprocessor and assembly language Create a procedure that returns the sum of all array elements falling within the range j...k (inclusive). Write a test program that calls the procedure twice, passing a pointer to a signed doubleword array, the size of the array, and the values of j and k. Return the sum in the EAX register, and preserve all other register values between calls to the procedure.

subject: microprocessor and assembly language Create a procedure that returns the sum of all array elements falling within the range j...k (inclusive). Write a test program that calls the procedure twice, passing a pointer to a signed doubleword array, the size of the array, and the values of j and k. Return the sum in the EAX register, and preserve all other register values between calls to the procedure.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter10: Pointers

Section10.1: Addresses And Pointers

Problem 7E

See similar textbooks

Similar questions

subject microprocessor and assembly language Create a procedure that fills an array of doublewords with N random integers, making sure the values fall within the range j...k, inclusive. When calling the procedure, pass a pointer to the array that will hold the data, pass N, and pass the values of j and k. Preserve all register values between calls to the procedure. Write a test program that calls the procedure twice, using different values for j and k. Verify your results using a debugger.
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…
Write and simulate a MIPS assembly-language routine that: 1. Prints your group number, for example “Group 1”, 2. Computes the dot product of two vectors, A_vec and B_vec, as described in Lab 4 of the Lab Manual, 3. Stores the result at memory word DOTPROD, and 4. Prints the result preceded by the phrase: “The result of the dot product is: “. Your data segment should look like the following: .data group: .asciiz “\nGroup x” msg: .asciiz "\nThe result of the dot product is: " A_vec: .word x, 4, 20, 13, 3, 10, 5 B_vec: .word 4, 2, 1, 2, 5, 2, 4 n: .word 7 DOTPROD: .word 0 Replace each “x” with your group number.
Write a PEP/8 machine language simulator that simulates the PEP/8 computer and instruction set for only the following instructions Here are some specifics. 1. Use an array to represent the memory. 2. Use variables or arrays for the PEP8 registers. I recommend putting it all into a structure. I also recommend using an array of 16 bit values for A, X, PC, SP so that you can use the r bit from the instructions to point directly to A or X. You do NOT have to include the Status bits. 3. Use unions of structures to break up the registers and instructions into the correct bits (for example, use a structure that can be unioned to break up the 8 bit specifier into the following bit combos (4, 1, 3), (5, 3), (7, 1), (8). This will allow you to instantly extract the instruction, register and addressing modes from each instruction. Also use a union to break up the 16 bit operand into two 8 bit values. 4. Have the instructions be inputted either through the command line or better yet,…
Using C program and array, 1.Input a non-zero positive integer. Then create an integer array that has a size equal to the inputted integer. 2.Using a loop, add integer values into the array one by one. The number of values to be stored is dependent on the inputted positive integer given in the first instruction. 3.Print out the elements of the array in reverse order. 4.Finally, print out the largest integer among all the elements on the array. Example: Input (The first line contains the size of the array. The second line contains the elements to be stored in the array) 5 34 3 23 10 Output (The first line contains the elements in reversed order. The second line contains the largest element) 10 23 3 34 5 34
Write a program in HACK assembly, without using symbols, that computes thebitwise exclusive or (XOR) of the values stored in RAM[1] and the value of thememory location with address stored in RAM[2]. The result of the computationshould be stored in RAM[0].You can think of RAM[2] as being a pointer to where the second operand of the XORis stored.
Have a question requiring an answer in assembly language
PLEASE CONVERT C CODE TO BASIC ASSEMBLY CODE. PLEASE PUT COMMENTS....
Note: assembly language(8086 microprocessor) Write a program that takes a number N (2 digit decimal) as input. Then the user will enter that many numeric values ranging from 0 to 9 as input. Here the user may enter a negative number too. The program then finds a pair of values whose summation is closest to zero.Explanation: Here at first the user enters 10, which is a 2 digit decimal number. That means the user now has to enter 10 negative or positive digits ranging from 0 to 9. Then the program will calculate the sum of all possible pairs and find the pair which gives the minimum sum. Here from the given example, we see that the sum of -2 and -4 which is -6 is the least sum.Input:10 -2, 3, 7, 4, -4, 7, -8, 0, 9, 9 Output: Pair of values which has the smallest sum = -4, -2
ADD [R1], R2, [R3]; Here [R1] and [R3] indicate memory locations pointed by R1 and R3 register respectively. Here the operand field next to opcode will hold the result at the end. Assume that the machine code of this instruction is loaded at address 1020H of the main memory. Also assume that the contents of registers R1, R2 and R3 are 2001H, 2002H and 2003H respectively. Moreover, 1000H, 2000H and 3000H are saved at memory addresses 2001H, 2002H and 2003H respectively. a) Draw a schematic diagram of a CPU, show its important functional units required to process this instruction.
It is the compiler's job to associate program variables with registers. Take, for instance, the assignment statement from our earlier example: f (g + h) (i + j): The variables f, g, h, i, and j are assigned to the registers X19, X20, X21, X22, and X23, respectively. What is the compiled LEGv8 code?
The following instruction set is supported by a simple processor, which is similar to what we discussed in the class, with a few new instructions added. The format of most instructions is defined as follows. bits 15:14 13:10 9 8:6 5:3 2:0 field unused opcode w srcl src2 dst where the fields are defined as follows. opcode : operation to be performed by the processor write back ALU output to register file (1= yes, 0 = no) address of the first ALU operand in the register file address of the second ALU operand in the register file address in the register file where the output is written w: srcl: src2: dst: For opcodes BEQ, BLEZ and JUMP, the 6 least significant bits (5:0) give an address in the instruction memory, which is byte-addressed. The opcode HALT has all operand bits (9:0) being 0. When an instruction has only two operands, the field for the unused operand is filled with 0-bits. For example, bits (5:3) for SLL are all zero because src2 is not used. The opcode and meaning of these…