1. The actions required to complete an instruction depend on the:

a.

ALU

b.	instruction class/type.

c.	instruction parameters.

d.	program counter.

2. Data lines cannot be wired together. In order to select between multiple sources, we use

a.	an AND gate

b.	a multiplexor.

c.	a register.

d.	a transistor.

3. The program counter

a.	is a 16-bit register.

b.	holds the current instruction.

c.	holds the address of the current instruction.

d.	holds the number of instructions.

4. A term represented by an "X" in a truth table is called a

a.	don't-care.

b.	don't-know.

c.	don't-understand.

d.	don't-worry.

5. In a non-pipelined processor, the clock cycle is determined by the longest possible path in a processor.

True

False

6. Pipelining improves performance by

a.	decreasing execution time of a single instruction.

b.	increasing instruction throughput.

c.	Both of the above.

d.	None of the above.

7. Which of the following is not a pipeline stage?

a.

Add.

b.

Decode.

c.

Fetch.

d.	Write back.

8. Under ideal conditions, the speedup from pipelining is approximately equal to the

a.	clock period.

b.	memory latency.

c.	number of instructions.

d.	number of pipeline stages.

9. In the pipeline discussed in class, we have separate instruction and data memories in order to avoid

a.	control hazards.

b.	data hazards.

c.	structural hazards.

d.	None of the above.

10. Another term for a data hazard as discussed in class is a

a.	constraint.

b.	dependency.

c.	limitation.

d.

negation.

11. Pipelining is a technique that exploits __________ among the instructions in a sequential instruction stream.

a.

branches

b.

latency

c.	parallelism

d.	redundancy

12. The technique used to eliminate stalls by making data available to active components before it can be read from the register file is known as

a.	forwarding.

b.

routing.

c.	streaming.

d.

writing.

13. Instructions that are executed in a different order than they were fetched is called

a.	haphazard execution.

b.	out-of-order execution.

c.	round robin execution.

d.	None of the above.