Download presentation
Presentation is loading. Please wait.
1
1 MIPS Assembly Language Programming CDA 3101 Discussion Section 04
2
2 Problem1 int chico[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int sum; void main() { int t1 = 0; int t2 = 10; int t3 = 0; do { int t5 = chico[t1]; t3 += t5; t1++; } while (t1 < t2); sum = t3; return 0; }
![2 Problem1 int chico[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int sum; void main() { int t1 = 0; int t2 = 10; int t3 = 0; do { int t5 = chico[t1]; t3 += t5; t1++; } while (t1 < t2); sum = t3; return 0; }](http://images.slideplayer.com./28/9399334/slides/slide_2.jpg "2 Problem1 int chico[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int sum; void main() { int t1 = 0; int t2 = 10; int t3 = 0; do { int t5 = chico[t1]; t3 += t5; t1++; } while (t1 < t2); sum = t3; return 0; }")
3
3 Problem1 > Exercises 5.1 Write a MIPS assembly language program to find the sum of the first 100 words of data in the memory data segment with the label “ chico ”. Store the resulting sum in the next memory location beyond the end of the array “ chico ”.
4
4 Problem2 int SRC[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int DEST[10]; void main() { int t2 = 0; int t3 = 10; do { t7 = SRC[t2]; DEST[t2] = t7; t2++; } while (t2 < t3); return 0; }
![4 Problem2 int SRC[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int DEST[10]; void main() { int t2 = 0; int t3 = 10; do { t7 = SRC[t2]; DEST[t2] = t7; t2++; } while (t2 < t3); return 0; }](http://images.slideplayer.com./28/9399334/slides/slide_4.jpg "4 Problem2 int SRC[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int DEST[10]; void main() { int t2 = 0; int t3 = 10; do { t7 = SRC[t2]; DEST[t2] = t7; t2++; } while (t2 < t3); return 0; }")
5
5 Problem2 Exercises 5.2 Write a MIPS assembly language program to transfer a block of 100 words starting at memory location SRC to another area of memory beginning at memory location DEST.
Similar presentations
![LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.](/12/3359156/big_thumb.jpg "LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.>")
![MIPS Coding. Exercise 1 4/17/2015week04-3.ppt2 Suppose we have three arrays, A, B, C, all of size 10. Now we want to set C[i] = min(A[i], B[i]) for all.](/12/3394356/big_thumb.jpg "MIPS Coding. Exercise 1 4/17/2015week04-3.ppt2 Suppose we have three arrays, A, B, C, all of size 10. Now we want to set C[i] = min(A[i], B[i]) for all.>")
![Array_strcpy void array_strcpy(char dest[], char src[]) { int i = 0; while (src[i] != '\0') { dest[i] = src[i]; i++; } dest[i] = '\0'; }](/12/3408609/big_thumb.jpg "Array_strcpy void array_strcpy(char dest[], char src[]) { int i = 0; while (src[i] != '\0') { dest[i] = src[i]; i++; } dest[i] = '\0'; }>")
