Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
how would i solve this MIPS assembly language version of the following C code segment:
how would i solve this MIPS assembly language version of the following C code segment:
int A[100], B[100];
for (i = 0; i < 98; i ++) {
C[i] = A[i + 1] - A[i] * B[i + 2];
}
Arrays A, B and C start at memory location A000hex, B000hex and C000hex
respectively. Try to reduce the total number of instructions and the number of
expensive instructions such as multiplies.
