5.2 Instruction Set Architecture (P2) Flashcards

1
Q

What is an addressing mode (and what are 3 examples)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a memory address

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is an n-address function (and how are the addresses typically distribuited between input and output)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Solve this problem using an immediate addressing mode

A
specified 1 as data in operand
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Solve this problem using a direct addressing mode

A
t is in address 1. 1 is the operand
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Solve this problem manually (no variable operands)

Dereferencing src
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Solve this problem using an indirect addressing mode

Dereferencing src
A
[r1] specifies that it is the address of the address, so would then use GPR
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is a static immediate and a static address (what do they refer to)

A

Also note the encoding pressure: instruction size must be > all operand bytes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Given the challenge of instruction pressure what are the following adressing strategies:
- Explicit
- Implicit
- Overloaded
- Derived
- Distributed

A

xi is the operand (address)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Solve this problem manually (no variable operands)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Solve this problem using an indexed addressing mode

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Solve this problem manually (no variable operands)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Solve this problem using an auto-indexed addressing mode

A

Note how it updates the base address

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Solve this problem manually (no variable operands)

Note the need of a scaling factor (more than 1 byte)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Solve this problem using a scaled-indexed addressing mode

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly