Question: The problems in this Exercise refer to the following function, given as array code: Compare the number of temporary registers (t-registers) needed for your array-based
The problems in this Exercise refer to the following function, given as array code:![a. void copy(int a[], int b[], int n) { int i; for(i=0; i-n;i++) a[i]=b[i]; b. } void shift(int a[], int n) {](https://dsd5zvtm8ll6.cloudfront.net/images/question_images/1698/1/3/6/40365378153b0a7d1698136402789.jpg)
Compare the number of temporary registers (t-registers)
needed for your array-based code from 2.33.1 and for your pointer-based code from 2.33.3.
Data from 2.33.1
Translate this function into MIPS assembly.
Data from 2.33.3
Translate your pointer-based C code from 2.33.2 into MIPS assembly.
a. void copy(int a[], int b[], int n) { int i; for(i=0; i-n;i++) a[i]=b[i]; b. } void shift(int a[], int n) { int i; for(i=0; i-n-1; i++) a[i]=a[i+1]; }
Step by Step Solution
3.38 Rating (164 Votes )
There are 3 Steps involved in it
To compare the number of temporary registers tregisters needed for the arraybased code and the pointerbased code we need to analyze the MIPS assembly ... View full answer
Get step-by-step solutions from verified subject matter experts
