第三章 计算机成原理.docVIP

Chapter：1,2,4,5,6,7,8,9,11,23,24 Add comments to the following MIPS code and describe in one sentence what it computes. Assume that $a0 is used for the input and initially contains n, a positive integer. Assume that $v0 is used for the output. begin: addi $t0, $zero, 0 # $t0 = 0 addi $t1, $zero, 1 # $t1 = 1 loop: slt $t2, $a0, $t1 # $t2 = 1 if $a0 $t1 bne $t2, $zero, finish # if $a0 $t1, jump to finish add $t0, $t0, $t1 # $t0 = $t0+ $t1 addi $t1, $t1, 2 # $t1 = $t1+2 j loop # jump to loop finish: add $v0, $t0, $zero # return $t0 A sample C program: int f(int n) { int i = 0; int j = 1; while( n = i){ i = i + j; j += 2; } return i; } The following code fragment processes an array and produces two important values in registers $v0 and $v1. Assume that the array consists of 5000 words indexed 0 through 4999, and its base address is stored in $a0 and its size(5000) in $a1. Describe in one sentence what this code does. Specifically, what will be returned in $v0 and $v1? Find the element which appears most times, $v0 stores the the maxium number of the identical integer in the array, $v1 stores its value. Show the single MIPS instruction or minimal sequence of instructions for this C statement: a = b +100;; Assume that a corresponds to register $t0 and b corresponds to register $t1. addi $t0,$t1,100 Show the single MIPS instruction or minimal sequence of instructions for this C statement: x[10] = x[11] + c; Assume that c corresponds to register $t0 and the array x has a base address of 4,000,000ten. 4,000,000ten=11,1101,0000,1001,0000,0000two lui $t1,61 addi $t1,$t1,2304 lw $t2,44($t1) add $t2,$t2,$t0 sw $t2,40($t1) The following program tries to cope words from the address in register $a0 to the address in register $a1, counting the number of words copied in register $v0. The program stops copying when it finds a word equal to 0. You do not have to preserve the contents of registers $v1, $a0,