Consider the following state of a computer:
Register R1 contains 800
Register R2 contains 3000
Memory location 1000 contains 2000
Memory location 2000 contains 3000
Memory location 3000 contains 1000
All numbers are expressed in hex notation. For the following three instructions, each is executed from the above initial state.
Assume each instruction is independent of the others:
MOVE *R2, R1 // move R1 to what R2 is pointing at
MOVE *R2, 1800(R1) // move the contents of the memory location indexed by R1 to what R2 //is pointing at
MOVI *R2, #DEAD // move the constant DEAD to what R2 is pointing at
(a) What is the effect of executing each instruction?
(b) How many words does each instruction occupy?
(c) How many memory accesses does the fetching and execution of each instruction require?