Week 6 Flashcards

1
Q

4 Mneumonics (Instruction Operators)

A

ADD, LOAD, STORE, JUMP

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

In most assembly languages, the target register goes _____ the source register

A

before

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

two parts of memory operands:

A

register and a constant (OFFSET)

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

general process when instruction is executed

A

processor reads the current value from register, adds offset, uses result as memory address

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

ex: LOAD r1, 20(r3)

A

r1 is what data will be loaded into, add 20 (offset) to r3 to get desired memory address

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

ex: JUMP 60(r11)

A

add 60 (offset) to r11, treat result as address in instruction memory

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

_____ contains value that specifies operation

A

opcode field

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

5 bit opcode implies ___ instructions

A

<=32 (2^5)

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

a register is a _____ value

A

pointer

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

offset is a _____ integer

A

2’s complement

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

3 steps hardware repeats:

A

use instr ptr to fetch instruction, use bits in instr to control hardware that performs operation, move instr ptr to next instr

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

choice of what statement to execute next

A

control flow

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

3 control flow paradigms:

A

sequential, skip ahead, step back

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

instr_bus <- Instr. memory[Current_Instr_Adder]

A

sequential

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

2 ways actual_next_instruction can be known:

A

statically (ahead of time; at compile time; Ex: Ordinary Statement) or dynamically (only known through executing program; Ex: while loop)

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

hardware separates fields of instruction such as ___

A

operations, registers, and offset

17
Q

computers have ___ that coordinate data movement

A

controllers

18
Q

1 output for K inputs

A

multiplexer

19
Q

operation fields are passed to the _____

A

ALU

20
Q

fastest to slowest operand types:

A

immediate operands, register operands, main memory

21
Q

CMOS favors ISAs with:

A

fixed-length instructions, simple field structure within representation, small ISA compiler can fully use

22
Q

Add

A

Add the integers in two registers and place the result in a third register

23
Q

Load

A

Load an integer from the data memory into a register

24
Q

Store

A

Store the integer in a register into the data memory

25
Q

Jump

A

Jump to a new location in the instruction memory

26
Q

Instruction pointer

A

Consists of a register(set of latches) in the processor that holds the memory address of the next instruction to execute

27
Q

Absolute Branch

A

Computes a memory address that specifies the location of the next instruction to execute

28
Q

Relative Branch

A

positive or negative increment for the program counter

29
Q

Current Instruction

A

Instruction of the current fetch execute cycle

30
Q

Program counter(PC)

A

Register that contains the pointer to the Current instruction

31
Q

Instruction Decoding

A

Hardware separates fields of the instruction

32
Q

Locality of Reference

A

Programs with large numbers of memory operands use them in small batches at a time