Consider the following high-level function. int f(int n, int k) { int b; b = k + 2; if (n == 0) b = 10; else b = b + (n \* n) + f(n - 1, k + 1); return b \* k; } Translate the high-level function f into MIPS assembly language. Pay particular attention to properly saving and restoring registers across function calls and using the MIPS preserved register conventions. Clearly comment your code. You can use the MIPS mul instruction. The function starts at instruction address exe0400100. Keep local variable b in $se. Please select file(s) Select file(s) Save Answer

Consider the following high-level function. int f(int n, int k) { int b; b = k + 2; if (n == 0) b = 10; else b = b + (n \* n) + f(n - 1, k + 1); return b \* k; } Translate the high-level function f into MIPS assembly language. Pay particular attention to properly saving and restoring registers across function calls and using the MIPS preserved register conventions. Clearly comment your code. You can use the MIPS mul instruction. The function starts at instruction address exe0400100. Keep local variable b in $se. Please select file(s) Select file(s) Save Answer

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

Q: CONVERT FOLLOWING C CODE INTO ARM ASSEMBLY CODE #include<stdio.h>int main() {int i, space, rows = 8, star=0; for(i = 0; i < rows-1; i++) {for(space = 1; space < rows-i; space++) {printf(" ");}for (star = 0; star <= 2*i; star++) {if(star==0 || star==2*i)printf("*");elseprintf(" ");}printf("\n");}for(i=0; i<2*rows-1; i++){printf("*");}return 0;}
8. Consider the following C code snippet. // c code void setArray(int num) { int i=5; compare (4, i); int compare (int a, int b) { if (sub (a, b) >= 0) return 1; else return 0; int sub (int a, int b) { return a - b; Implement the C code snippet in ARM assembly language. Use R4 to hold the variable i.
11.Code so on for_A pure full Implement c/c++ to evaluate round robin algorithm. You must use the job list given here: Job (1) arrive at CPU cycle1 Job (2) arrive at CPU cycle2 Job (3) arrive at CPU cycle36 I/O (32) CPU (54) I/O (45) CPU (20) I/O (40) CPU (48) CPU (39) CPU (48) I/O (55) Your job list must contain CPU bust and I/O bust as above. Quantum time = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60] The evaluation of the most suitable quantum time needs to consider the followingperformance metrics, but not limited to:(i) Turnaround time of the jobs;(ii) Waiting time of the jobs; and(iii) Number of interrupts incurred The code must able to read csv file format of the job list as input file. The code must able for user to input time quantum.. ..
Giving assembly code for function int myfunction(int b, int c, int d); int z; _asm{ mov ebx, b mov edx, d mov ecx, c add ebx, ecx sal ebx, 2 add edx, ebx mov eax, edx mul ecx mov z, ecx } return z; write the c code of this function
int total; int i; total = 0; for (i = 10; i > 0; i--) { total + i; } The following translates this into ARM assembler: /* -- sum-to-ten.s */ .text .global start _start: mov rº, #0 mov r1, #10 again: end: add r0, r0, r1 subs r1, r1, #1 bne again mov r7, #1 swi 0 @r0 := 0 @r1 = 10 @r0 := r0 + r1 @ r1 := r1 - 1 @loop again if we haven't hit zero @setup exit @exit In the above assembly language program, we first use the MOV instruction to initialize RO at O and R1 at 10. The ADD instruction computes the sum of RO and R1 (the second and third arguments) and places the result into RO (the first argument); this corresponds to the total += i; line of the equivalent C program. Note the use of the label at the beginning of the ADD instruction. The label is simply the relative memory address of where that instruction is when the assembler loads it into memory. The subsequent SUBS instruction decreases R1 by 1. To understand the next instruction, we need to understand that in addition to the…
Translate function f into LEGV8 assembly language. If you need to use registers X10 through X27, use the lower-numbered registers first. Assume the function declaration for g is “int g(int a, int b)". The code for function 2.32 f is as follows: int f(int a, int b, int c, int d){ return g(g(a,b),c+d); }
**ARM language**Assuming that L, N, LEnd and p are held in registers R1, R2, R3 and R4 respectively, give the ARMassembly language code which corresponds to the two statements p+= *L; L++; in Plus2int Plus2( int *L, int N ) {int *LEnd, p;p = 0;LEnd = L+N;while( L < LEnd ) {p += *L; L++;}return p;}
Instruction: Explain the function of the program line by line thoroughly.Program: #include <iostream> using namespace std; //Swap functionvoid swap(int *xp, int *yp){ int temp = *xp; *xp = *yp; *yp = temp;} void selectionSort(int arr[], int n){ int i, j, min_idx; // One by one move boundary of // unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in // unsorted array min_idx = i; for (j = i+1; j < n; j++) if (arr[j] < arr[min_idx]) min_idx = j; // Swap the found minimum element // with the first element if(min_idx!=i) swap(&arr[min_idx], &arr[i]); }} //Function to print an arrayvoid printArray(int arr[], int size){ int i; for (i=0; i < size; i++) cout << arr[i] << " "; cout << endl;} int main(){ int x, n; cout << "Enter number of integers: "; cin >>n; int *arr = new int(n); for (int i = 0; i < n; i++) { cout << " Enter Integer No. " << (i + 1) << ": ";…
assembly language programs for the 8086 microprocessors to perform multiplication of two matrices Am*n and Bn*p. The value of m = 4, n = 2, and p =3. Assembly lan+ Assume all the elements in matrices A, B, and answer of the multiplication are 8-bit numbers. Flow chart Pseudocode Assembly Code with brief describe comments (EMU8086 emulator).
Write a MIPS assembly language program that implements the following recursive function: if n 6 function1 (n) = (n % 2) + 4 function1(n-5)/n + function1 (n-3)*7 -n *see the pesudo-C code below as a reference: void main() { int ans, n; 4 printf("User Integer:\n"); 7 scanf("%d", &n); 8 ans = function1(n); 10 11 printf("Solution: %d\n", ans); 12 13 return; 14 } 15 int function1(int n) 17 - { 16 if (n <= 6) { int ans1 = (n % 2) + 4; return ans1; } else 18 19 20 21 22 23 { int ans1 = function1(n-5)/n + function1(n-3)*7 - n; return ans1; } 24 25 26 27 28 sample output: User Integer: 13 Solution: 114
14. Translate function f into MIPS assembly language. If you need to use registers St0 through $t7, use the lower-numbered registers first. Assume that the function declaration for func is "int func(int a, int b);". $a0 and Sal hold the arguments of function func. The code for function func is as follows: int func(int a, int b){ return func(a+b, a*2); }
hwy immutable memory can be faster in functional programing?