Consider the following partial C program: int gData[4]; // global array -- only global variable in the program int swapEnds (int data[], int size) { int i; int j; int tmp[4]; ... stuff deleted ... return 1; } Suppose we are generating LC-3 code to evaluate the expression tmp[i]. Write the LC-3 instruction that puts the base address of the array into RO.

Suppose the following code: int a, b, c;char array[100];void f(int& val){char* arr = new char[100];for(int i = 0; i < val; ++i){arr[i]  = i*i;}}int main(){int myValue = 123;f(myValue);return 0;} Think about which section of process memory each part of this program would occupy during execution. Then, match items on the left with their storage locations on the right.

1. Convert the following C code into MIPS assembly: void array_comp(int num) { int array [10]; int i; for (i=0; i= 0) return 1; else return 0; int sub (int a, int b) { return a-b; }