Q1: Write a MIPS procedure that corresponds to the following C code: int A[100],
ID: 641303 • Letter: Q
Question
Q1: Write a MIPS procedure that corresponds to the following C code:
int A[100], B[100];
for ( i=0; i<100; i++ )
{ if(B[i] > 10)
A[i] = A[i] + B[i];
else A[i] = A[i]*2; }
Q2: a- Write the equations for the carry-lookahead logic for a 32-bit adder. b- (2pts) Calculate the delay for the carry-lookahead logic in question 4a (remember: the logic that consists of OR or AND results in one gate delay and the logic that consists of the OR of several AND terms results in two gate delays).
Q3: Calculate the gate-delay for the relative speed of a 64-bits adder using: ripple carry only, ripple-carry of 4-bit groups that use carry lookahead and carry-lookahead scheme.
Explanation / Answer
function in MIPS
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.