Blog

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 

Imagine in the PennSim simulator line 3 (address 0x321F) was highlighted yellow (line of code to be executed next). If we hit:    Step the next line highlighted would be [1]    If instead we hit Next the next line highlighted would be [2] If the current highlighted line was line 7 (address 0x3222) and we hit Next the next line highlighted would be [3]

Complete the drop downs to implement blocks A and B of this flowchart in most logical way                  [1][2][3]                  [4][5][6]                  [7][8]

When a BRnz instruction is executed, the branch will be taken [1] The BRnz branch will be taken if the last value written to a register was [2] If one leaves the flag specifiers off a BRx instruction  (i.e. just a BR instruction) the [3]  

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 ≠ -5                            …                           [7] MORECODE                           ; executes after joining                           ; for both cases  

The state of an LC-3 is shown including the contents of the instruction register.  The PC has already been incremented. With the condition codes (NZP) as shown the next instruction to be executed would be at address [1] If the bits in the instruction specifying the condition codes to test were 001 the next instruction to be executed would be at address [2]