Practice Instruction Fetch Process (19.2.1) - Finite State Machine Implementation for ADD R1,M

Practice: Instruction Fetch Process

Lesson 19.2.1Finite State Machine Implementation for ADD R1,M

Practise this section

10 questions

Flashcard drill
4 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
4 questions · about 3 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What does the program counter do in the instruction fetch process?
Show hintHide hint
Think about how CPUs know which instruction to execute next.
Question 2.
What is the function of the Memory Address Register (MAR)?
Show hintHide hint
Consider what happens in memory operations.
3Question 3.
What does the program counter do?
- Holds the current instruction
- Tracks the next instruction address
- Stores the last executed instruction
Show hintHide hint
Think about which register manages the flow of the instruction cycle.
4Question 4.
The Memory Address Register is responsible for:
- True
- False
Show hintHide hint
Recall what happens to addresses in memory transactions.
Question 5.
Sketch an FSM diagram representing the instruction fetch sequence showing states and transitions. Include at least three states and discuss transitions based on signal changes.
Show hintHide hint
Think diagrammatically about the flow of signals and operations.
Question 6.
Discuss how the instruction fetch process could be optimized to allow faster processing within the CPU architecture. What could be introduced?
Show hintHide hint
Consider modern techniques in CPU design for efficiency.

6 more questions in this section. Enroll free to practise them all.