Explore BrainMass

Truth table for circuit diagram

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

1. a) Draw the truth table for the circuit shown below.
b) Show an extrusion of this circuit that realizes a DFF.

(see attached file for diagram)

© BrainMass Inc. brainmass.com October 24, 2018, 8:47 pm ad1c9bdddf


Solution Preview

Please see the attached file.

First we need to recall the truth table f the SRFF:

S R Qn+1
0 0 Qn
0 1 0
1 0 1
1 1 N/A

Note that Qn+1 follows the input S except when S=R. When S=R=0 the ouput is unchanged, while if S=R=1 the input settles in an undetermined state.

Now we write the functions for S and R:

It is obvious that when Φ=0, both S and R are kept at zero, hence there is ...

Solution Summary

This solution provides detailed explanations with diagrams for various questions regarding circuits.

See Also This Related BrainMass Solution

A worked example design exercise to derive next state logic and state transition diagrams and truth tables by analysing a given J-K flip flop circuit design

This solution shows how to work from a given circuit implementation (a J-K flip flop circuit design) to derive the Boolean Logic and in so doing so simplify such logic using Boolean Algebra rules. The solution then goes on to show how such next state logic can be applied to K maps (that describe the next states) and derives next state truth tables. Finally the solution shows how, from the next state truth table, the state diagram can be derived.

View Full Posting Details