Address calculation and instruction count

problems:

1. Show the matrix base address (of A, B and C) in hexadecimal.
2. Report the size of a double floating point number.
3. Report the size of the matrix, in bytes.
4. For each of A, B and C, report the address of:
   1. array[0][0]
   2. array[0][1]
   3. array[0][size-1]
   4. array[1][0]
   5. array[size-1][0]
   6. array[size-1][1]
   7. array[size-1][size-1]
5. Give a formula for calculating the address of element i,j of the matrix.
6. Is this row major or column major form of storing a matrix?
7. Compile your C program to assembly (“-S” option on compile).
8. Edit the assembly program, adding comments. Ignore everything except the matrix multiply portion:
   1. Identify the loop controls. How many nested loops are there?
   2. Identify the instructions that calculate the element addresses for A, B, and C matrix elements.
   3. Identify the actual floating point multiply and adds.
   4. Identify what variables are kept in CPU registers.
9. Calculate the total number of instructions in the matrix multiply.

Parts of this will be kind of a hassle, because of the complicated x86 and ARM addressing modes (MIPS is simpler). Submit the edited assembly source, and a report (in PDF) with the answers to the other questions. Submit them in a tar or zip file.