Problem 0. Consider array variables declared as follows: int counts [20]; int *links [10]; Suppose register %rbx contains the starting address of counts, and %rdi contains the starting address of links Also, %rdx contains a value i, and %rcx contains j. For each of the following array expres- sions, write a single assembly code instruction that will put the value of that expression in the register %rax For example, if the expression is counts [10], you would write movl $40 (%rbx), %rax. a. counts [i] b. counts [j+2] c. links [j] d. *(links+4)

Problem 0. Consider array variables declared as follows: int counts [20]; int links [10]; Suppose register %rbx contains the starting address of counts, and %rdi contains the starting address of links Also, %rdx contains a value i, and %rcx contains j. For each of the following array expres- sions, write a single assembly code instruction that will put the value of that expression in the register %rax For example, if the expression is counts [10], you would write movl $40 (%rbx), %rax. a. counts [i] b. counts [j+2] c. links [j] d. (links+4)

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The 32-bit RISC-V base integer instruction set (rv32i) does not support multiplication and division operations. To deal with this, a compiler may call a function when a multiplication is needed. For example, gcc expects that a function - mulsi3(unsigned int a, unsigned int b) is provided to multiply two integers. A multiplication can be carried out by repeated additions and shifts: unsigned int -_mulsi3 (unsigned int a, unsigned int b) { unsigned int r = 0; while (a) { if (a & 1) { r += b; } a >>= 1; b <<= 1; } return r; } a) Translate the above C code into equivalent RISC-V rv32i assembler code. Comment the as- sembler code to explain how the calculation proceeds. Note that the arguments are passed via the registers a0 (x10) and a1 (x11) and that the result is returned in a0 (x10). b) Does the function need function call prolog and epilog? Explain why or why not. You are invited to use emulsiV to develop and test your assembler code.
38. Implement the following expression in assembly language, using 32-bit integers (you may modify any registers you wish): eax = -dword1 + (edx - ecx) + 1 You can use this data definition for testing your code: dword1 DWORD 10h 39. se the following data declarations to write an assembly language loop that copies the string from source to target. Use indexed addressing with EDI, and use the LOOP instruction source BYTE "String to be copied",0 target BYTE SIZEOF source DUP(0),0
x86 Assembly Programming-MASM - Use Irvine32.inc Write a program with a loop and indexed addressing that calculates sum of the values of elements of a DWORD array that are located at multiple of 5 location. For example for the array 2,3,4,5,6,7,8,9,10,11,12,13,14,15 Program calculates: 5+10+15
Systems Programming Purpose: The purpose of this assignment is to practice loop instructions and array iterations in M6800 assembly language programming. Write an assembly language program which implements the following C code that is a find minimum problem solution implementation: int A[10] = {8, 14, 6, 16, 5, 5, 10, 9, 4, 11}; int i = 0; int min = 255; // This is the largest number 8-bit accumulators can hold. while (i < 10) { if (A[i] < min) min = A[i]; } Your solution should be able to handle all possible array elements and orderings for any value an accumulator can hold. You should treat variable į as XR in assembler (index register) and store variable min in the address 60H. 0010: 00 00 00 00 00 00 00 00 0O 00 00 00 00 00 00 00 8628: 00 060 00 00 00 600 00 00 00 08 08 00 6 00 00 00 0030: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 0040: 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 00 0050: 00 G0 00 00 00 00 00 00 00 00 00 00 00 00 00 00 006 0: 00 00 00 00 00 00 00 00 00 08 00…
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…
Task Write a program in the ARMLite assembly language which generates the Fibonacci number F(12) and stores the value in register R6. • You must use a loop to generate the value. Partial marks will be given for otherwise correct but non-loop based solutions • There is no limit on the number of registers you can use • The stack memory may be used, but is not required • Other memory access is not allowed or needed • Add a comment to the top of your program describing it's behaviour. You should make use of comments to describe your code's sections. Submit your program as a plain text file. If you are using the ARMLite simulator, it can be exported directly using the 'Save' button.
4. A particular piece of loop iteration requires 6 registers, 2 of which are used to track array indices / loop counters. The other 4 registers are used to hold load values, compute results and store results. If the architecture has 32 general-purpose registers, then how many times can the loop be unrolled by the compiler?
E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code
Write an assembly procedure that has: (1) an array of byte sized values passed through a pointer register (2) an 8-bit register that tells the size of the array. The procedure should replace the contents of each cell with the sum of the contents of all the cells in the original array from the left end to the cell in question. Thus, for example, if the array passed to the function looks like this: 5 2 9 3 7then when the function returns, the array will have been changed so that it looks like this: 5 7 16 19 26Use the procedure in a complete valid code. Notes: 1- you are asked to show all the results to the teacher assistant 2- the values should be entered from the keyboard
An-Najah National University Department of Computer Engineering Microprocessors (10636322) Assignment # 1 Answer the following: 1- Write an 8086-assembly program that reads only vowels (a, e, i, o, u) from the keyboard (other characters are not excepted) and store them in a character array of 10 bytes long. Vowels entered after the array is full should be discarded. The program should stop reading characters when a 'S' is entered. When the 'S' character is entered, the program should output a new line, followed by the contents of the character array, with a space character between each vowel. 2- Write an assembly code to sort a word array of 50 numbers in ascending order. 3- The perfect number is defined as an integer which is equal to the sum of its divisors. Example: 28 is perfect number because 28 = 1+2+4 +7+ 14. Write an inline assembly e function that will takes an integer number as parameter and check whether it is a perfect number or not. Use the function in complete program. 4-…
MIPS Simulator QtSpim: You are to have a complete program in MIPS assembly language that behaves exactly as the included C program. This program contains four functions in addition to the main() one. Your solution must contain all five C routines as they have been coded in the example. Make sure to run the program in MIPS and show the same output on MIPS as well to make sure there are no errors. Below is the five C routines and attached is the image of what the output must print out on QtSpim. #include <stdio.h> int getMax(int arr[], int n){int mx = arr[0];for (int i = 1; i < n; i++)if (arr[i] > mx)mx = arr[i];return mx;}void countSort(int arr[], int n, int exp){int output[n];int i, count[10] = { 0 };for (i = 0; i < n; i++)count[(arr[i] / exp) % 10]++;for (i = 1; i < 10; i++)count[i] += count[i - 1];for (i = n - 1; i >= 0; i--) {output[count[(arr[i] / exp) % 10] - 1] = arr[i];count[(arr[i] / exp) % 10]--;}for (i = 0; i < n; i++)arr[i] = output[i];}void…
Write a assembly code for 8086/8088 that replace the contents of each cell with the sum of the contents of all the cells in the original array from the left end to the cell in question. Thus, for example, if the array passed to the function looks like this: 5 2 9 3 7 then when the function returns, the array will have been changed so that it looks like this: 5 7 16 19 26