Blog

After the LD instruction is executed, what is the value in register R1? (answer as 4-digit hex) [1] After the LEA instruction is executed, what is the value in register R3? (answer as 4-digit hex) [2] After the LDR instruction is executed, what is the value in register R5? (answer as 4-digit hex) [3]

NOTE: This problem is manually graded, therefore will show as zero till graded.  (max auto graded score is 79) Download (right click “Save link as”) this algorithm that performs multiply.  Read the comments and look over the code.  There is nothing wrong with the algorithm. The issue is, it is coded as a stand alone algorithm, not as a sub-routine.  You add the “dressings” around it to make it into a proper sub-routine that multiplies the two numbers in R1 and R2 and returns the result in R0. When you are satisfied with your code copy and paste it into the “essay” box below. You could try to compile and test it in PennSim but that would be a foolish waste of time that you do not have.  Small syntax issues will not be graded harshly.

MyString  .STRINGZ  “234” The above assembler directive reserves [1] words of memory.  The words are allocated/initialized as [2][3][4][5]

At what 4-digit hex address is the label LOOP defined [1] What offset (answer as a decimal number) would be encoded into the BRnp instruction [2] True/False: (simply type true or false in the box) the program would not work if line 29 was: RESULT  .BLKW 1                  [3]  

NOTE: This is a manually graded question, therefore it will show as zero till graded.  Download this template for a Multiply ACcumulate (MAC) unit sub-routine. It is intended to employ the MULT routine you wrote earlier in this exam (i.e call it).  Do not, however, bother repeating your earlier MULT routine code here. When you are satisfied with your code copy and paste it into the “essay” box below. NOTE: this code is intended to be a sub-routine (i.e. it will be called as well)

Complete code that takes a branch if the 2-LSBs of R0 are 01 (i.e. if R0[1:0]==01) TEST_01       [1]R0,[3]                        ADD R1, [2], #-1                         [4] SKIP                           ; code that is skipped if R0[1:0] == 01 SKIP                            

Match each instruction with what its destination is (i.e. does the instructions result end up in memory, a register, …)  

NOTE: This problem is manually graded, therefore will show as zero till graded.  (max auto graded score is 79) Download (right click “Save link as”) this template for an ABS routine.  Look at the comments for what it should perform and complete the code. When you are satisfied with your code copy and paste it into the “essay” box below.

Code exists in blue box, but is not shown If the DONE label exists at address 0x0280 then what is the address of oneLabel (enter 4-digit hex) [1] The code in the blue box is now shown above (NOTE the label used in the LEA).  What value must ??? be to make the comments correct (answer as a decimal number) [2]

Implement in optimal manner TEST               [1] R1, [2]                            [3] [4] R0_IS_5        ;  code if R0 = 5                            …                            [5][6] R0_ISNT_5 ; code if R0