5.Convert the following high-level code into RISC-V assembly language. Assumethat the signed integer variables g and ŉ are in registers to and t1, respectively. You canuse other temporary registers like t2 and t3 if needed.a)b)if (g % 8 == 3 || g % 8 == 5)h = h * 5.5;elseh = h 16;if (g % 16 > 4 && g % 16 < 12)h = (g + 5 * h) % 8;elseh = (g + 8.5 * h)* 9; 4.Convert the following high-level code into RISC-V assembly language. Assumethat the signed integer variables g and ŉ are in registers to and t1, respectively. You canuse other temporary registers like t2 and t3 if needed.a)b)if (g > h)g = (g + 7) * 2.5;elseh = (hif (g <= h)g = (gelse6)/16;h) % 32;g = (g + 3 * h)* 14;

Please note that as per bartleby standards if multiple questions are posted then only first question…

5. Convert the following high-level code into RISC-V assembly language. Assume that the signed integer variables g and ŉ are in registers to and t1, respectively. You can use other temporary registers like t2 and t3 if needed. a) b) if (g % 8 == 3 || g % 8 == 5) h = h 5.5; else h = h 16; if (g % 16 > 4 && g % 16 < 12) h = (g + 5 * h) % 8; else h = (q + 8.5 * h) * 9;

5. Convert the following high-level code into RISC-V assembly language. Assume that the signed integer variables g and ŉ are in registers to and t1, respectively. You can use other temporary registers like t2 and t3 if needed. a) b) if (g % 8 == 3 || g % 8 == 5) h = h 5.5; else h = h 16; if (g % 16 > 4 && g % 16 < 12) h = (g + 5 * h) % 8; else h = (q + 8.5 * h) * 9;

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

Translate the following C code to MIPS compiler code. Assume that the variables f, g, h, i, and j are assigned to registers $s0, $s1, $s2, $s3, and $s4, respectively. Assume that the base address of the arrays A and B are in registers $s6 and $s7, respectively. Assume 4-byte 1.) B[8] = I + J 2.) H = I – J 3.) A[4] = F + G + H 4.) A[0] = G + H + A[4] – 4
2. C code to Machine Code: Translate the following C code to Assembly code and then Machine Code. Assume that the variables, k, i and jare assigned to registers $50, $s1, $s2, respectively. Assume that the base address of A, B, C and D are in registers $s3, $s4, $55, $s6 respectively. Assume that the elements of the arrays A, B, C and D are integers: C[k] = A[i] / B[j]; D[k] = A[i] & B[j];
Assume a CPU with a fixed 32-bit instruction length has the following instruction format:opcode mode [operand1] [operand2] [operand3]The mode encodes the number of operands and each operand’s mode. For instance, one mode indicates three registers, another indicates two registers and an immediate datum, another indicates a main memory reference, etc. Assume there are 94 instructions and 22 modes. Answer the following.a. One mode indicates three registers. How many registers can be referenced in this mode?b. One mode indicates two registers and an immediate datum in two’s complement. Assuming there are 32 registers, what is the largest immediate datum that can be referenced?c. One mode has a destination register and a source memory address (an unsignednumber). Assuming 16 registers, what is the largest memory reference available?d. One mode has two memory addresses, both using base displacement. In both, the basesare stored in index registers and the displacements are specified in the…
Please change this C code to Assembly program(x86 and ARM assembly gcc) #include <stdio.h>int main() { unsigned guess; /* current guess for prime */ unsigned factor; /* possible factor of guess */ unsigned limit; /* find primes up to this value */ printf("Find primes up to: "); scanf("%u", &limit); printf("2\n"); /* treat first two primes as special case */ printf("3\n"); guess = 5; /* initial guess */ while ( guess <= limit ) { /* look for a factor of guess */ factor = 3; while ( factor*factor < guess && guess % factor != 0 ) factor += 2;if ( guess % factor != 0 ) printf("%d\n", guess); guess += 2; /* only look at odd numbers */ }printf("Recieves a number(limit) and prints its all divisors"); for(int i = 1; i <= limit; i++) { if((limit%i) == 0){ printf("\n%d", i); } } return 0; }
isincreasing function write an hla assembly language program that implements the following function: procedure isincreasing( i: uns32; j : uns32; k : uns32 ); @nodisplay; @noframe; this function should return into eax the value 1 if i < j and j < k; otherwise, return into eax the value 0. in order to receive full credit, you should be preventing register corruption by preserving and then restoring the value of any register your function touches. this rule applies to every register except for eax which is being used to pass an answer back to the calling code. feed me i: 5 feed me j: 13 feed me k: 33 eax = 1
Please give me correct solution.
1. Given the following C code: short ARR [50]; // short is 2 bytes for (short i = 1; i<= 50; i++) ARR [i] = i * i; Convert this code into assembly. Write two versions of the code by using two different addressing modes.
1B. Write three address code and quadruple for the expression a[i] = -b * (a[k--]- y[ k--] /2)
Assembly Lang. x86
Translate the following pseudo code into MIPS assembly to show each of the addressing modes.. Variables x and y should be maintained in data memory since they are static and volatile. When using register direct access, you do not need to retain variables in memory. main() { static volatile int miles = prompt("Enter the number of miles driven: "); static volatile int gallons = prompt("Enter the number of gallons used: "); static volatile int mpg = miles / gallons; output("Your mpg = " + mpg); }
@@@@@ ##₹8.
Compile the following C code snippet with different processor architecture. int square(int num) { return num * num; } 1) compile using armv7-a clang 11.0, and explain the program. 2) compile using x86-64 gcc 11.2, and explain the program.