Practice Finite State Machine Implementation For Add R1,m (19.1) - Finite State Machine Implementation for ADD R1,M

Practice: Finite State Machine Implementation for ADD R1,M

Lesson 19.1Finite State Machine Implementation for ADD R1,M

Practise this section

9 questions

Flashcard drill
3 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
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is a finite state machine?
Show hintHide hint
Think about how a system can be in one state at a time.
Question 2.
What does the Memory Function Complete (MFC) signal indicate?
Show hintHide hint
What signal tells the CPU it can proceed with the next operation?
3Question 3.
What does MFC stand for?
- Memory Function Complete
- Main Function Control
- Memory Fetch Completed
Show hintHide hint
What does the M signal tell the CPU?
4Question 4.
True or False: Every instruction is connected to a unique finite state machine.
- True
- False
Show hintHide hint
Think about how instructions are processed in a CPU.
Question 5.
Design a finite state machine for the instruction SUB R1,R2 with at least 5 states, providing the function of each state.
Show hintHide hint
Consider all steps necessary to execute the subtraction operation.
Question 6.
Given delays in control signals could affect the operation of a CPU, how would you mitigate such delays in your FSM design?
Show hintHide hint
Think about techniques that can apply in digital circuits to handle delays.

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