Computing 2n
R1
R2
R4
R5
R6
R7
R8
R9
R10
R11
R12
R13
R14
R15
R0
R3
registers
0 1 2 3 4 5 6 7 8 9 A B C D E F
0 1 2 3 4 5 6 7 8 9 A B C D E F
20
00
21
04
22
01
24
07
23
01
B1
42
50
A3
07
B0
3A
C0
00
00
00000000
04
00000100
01
00000001
07
00000111
01
00000001
00000001
00000010
00000010
00000100
00000011
00001000
00000100
00010000
04
04
01
10
07
02
PC
30
32
34
36
38
3A
R0=R1?
3C
3E
40
R0=R0?
3A
R0=R1?
3C
3E
40
R0=R0?
3A
R0=R1?
3C
3E
40
R0=R0?
3A
R0=R1?
3C
3E
40
R0=R0?
3A
R0=R1?
42
44
Previous slide
Next slide
Back to first slide
View graphic version