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

Q2. Refer to datapath design on slide no. 26 with added blocks for jump instructions as shown in slide 33 in Chapter 4 (part 1). Let's assume a program has 500 instructions. These instructions are distributed as follows: R-Type 25% Immediate arithmetic (addi) 5% Load 20% Store 20% Branch 10% Jump 20% Answer the following questions (show calculations): a) How many instructions will use instruction memory? b) How many instructions will use data memory? c) How many instructions will use the sign extend block? d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes, how? If not, what happens to the output of the block in that cycle?
Quiz-1: Refer to Lecture-3 Module 1 swap (int* V, int k) { temp = V[k]; /* temp in $t0 */ V[k] = V[k+1]; V[k+1] = temp; } Write the swap() function using special registers required for accessing parameters passed to this function. Use “t” registers for any needed temporary registers.
Convert the following C program to MIPS assembly code
Assume variable h is associated with register X21 and the base address of the array A is in X22. What is the LEGv8 assembly code for the C assignment statement below? A[12] = h+ A[8]:
Question 1 Consider two C++ int arrays A and B. The base address of A is held by $=0, and B $s1. Variable i A Bx Y Variable i is an index into A. Assume i is never out of Register $to $s0 $s1 $s2 $=3 index bound. Variable x and y are C++ int variables. Write the instructions corresponding to the C+ code block below. Each task is independent. i. BI 6 1 = AL 11 1 + BI 3 1; * Sti = Al 11 1 1 2 3 * St3 = Al 11 ] + BI 3 1 co
answer with proper explanation and step by step solution. The instruction is to use a "loop" to write the MIPS code for this.
Please your code should be in mips assembly language
Assume variables i and j are declared as named variables in main memory. Write a complete program that correctly executes the following C statement into MIPS assembly instructions. You will need to get the value, i, from memory into register $s1, get the value, j, from memory into register $s2, and the base address of array A is in $s3. A[j] = A[i+j] - 8*j;
Code with comments and output screenshot. I will Upvote. Thank you!
Implement nibble_swap() function. Take in 4 byte integer and returns integer with swapped nibbles in first two bytes. Use a 3 bit register. The template below is for your reference. The code in the Assembly code portion needs to be completed in Assembly x86-64 #include extern "C" int nibble_swap(int var); int main(int avgc, char** avgs) { int v = nibble_swap(0xCAFEBABA); //answer: 0xACEFABAB printf("Swapped Variable is : 0%X \n", v); return 0; } ----------------Assembly Code --------------------------- ;yasm -f elf64 var.asm section .text global start : ;put ur code here ret
Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…
In this implementation, each instruction is provided with its own data independently of how other instructions acquire theirs. We insert a(n): A Multiple Input/Output B The Case of Many Pieces of Information or Directions C Unique Information Only One D Several Insts From One