1. A stopwatch has three states named Zero, Running, and Stopped. There are two buttons, named B1 and B2. For each button, pressing the button produces a 1 and not pressing the button produces a 0. B1 works as follows: If the stopwatch is in the Zero state, pressing B1 causes it to advance to the Running state. If the stopwatch is in the Running state, pressing B1 causes it to advance to the Stopped state. If the stopwatch is in the Stopped state, pressing B1 causes it to return to the Running state. Pressing B2 has no effect unless the stopwatch is in the Stopped state, in which case pressing B2 (even if B1 is pressed) causes the stopwatch to go to the Zero state. Design a finite state machine controller for this stopwatch that has two inputs (B1 and B2) and three outputs, one for each of the three states. The state of the controller uses two J-K flip-flops. a. Draw the State Diagram for the controller on page 1 of your answer document using either method I or II. I. You can use the shapes and drawing tools of Microsoft Word to create the state diagram directly on page 1 of your answer document II. Or, you can draw the state diagram on a piece of paper, take a picture of your drawing, and then insert the picture on page of your answer document. Make sure the picture fits entirely on page 1. You can resize a picture in a Word document. b. Then, use the state mapping table below and your state diagram to complete the truth tables on page 2 of your answer document. Use "don't cares" (X) for inputs and outputs as needed. Si So 0 0 0 1 1 0 1 1 State Name Not Used Zero Running Stopped c. Finally, write the simplified Boolean equation for the outputs (NSo and NS1) of the next state function and the outputs (Zero, Running, and Stopped) for the output function on page 3 of your answer document. Use Microsoft Word's built-in equation editor.
1. A stopwatch has three states named Zero, Running, and Stopped. There are two buttons, named B1 and B2. For each button, pressing the button produces a 1 and not pressing the button produces a 0. B1 works as follows: If the stopwatch is in the Zero state, pressing B1 causes it to advance to the Running state. If the stopwatch is in the Running state, pressing B1 causes it to advance to the Stopped state. If the stopwatch is in the Stopped state, pressing B1 causes it to return to the Running state. Pressing B2 has no effect unless the stopwatch is in the Stopped state, in which case pressing B2 (even if B1 is pressed) causes the stopwatch to go to the Zero state. Design a finite state machine controller for this stopwatch that has two inputs (B1 and B2) and three outputs, one for each of the three states. The state of the controller uses two J-K flip-flops. a. Draw the State Diagram for the controller on page 1 of your answer document using either method I or II. I. You can use the shapes and drawing tools of Microsoft Word to create the state diagram directly on page 1 of your answer document II. Or, you can draw the state diagram on a piece of paper, take a picture of your drawing, and then insert the picture on page of your answer document. Make sure the picture fits entirely on page 1. You can resize a picture in a Word document. b. Then, use the state mapping table below and your state diagram to complete the truth tables on page 2 of your answer document. Use "don't cares" (X) for inputs and outputs as needed. Si So 0 0 0 1 1 0 1 1 State Name Not Used Zero Running Stopped c. Finally, write the simplified Boolean equation for the outputs (NSo and NS1) of the next state function and the outputs (Zero, Running, and Stopped) for the output function on page 3 of your answer document. Use Microsoft Word's built-in equation editor.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter5: Control Structures Ii (repetition)
Section: Chapter Questions
Problem 27PE
Related questions
Question
Computer science homework
Please help me with this question as I really need help.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr