This is an open book, open notes exam. It is to be turned in by 8:30 PM.
Use truth tables to show that the following two Boolean expressions are equivalent:
Simplify the following three Boolean expressions using Boolean algebra.
Simplify the following two Boolean function using a Karnaugh map. Notice that the second function has some ``don't care'' conditions.
Translate the following function
into the sum-of-products notation.
Which is the more versatile gate -- the NAND or the OR? Explain your answer.
What happens when a JK flip-flop is clocked when both the J and K inputs are 1?
The following state table is for a finite state machine with a single input x, a single output z, and two state variables A and B. (The four columns on the right are not part of the state table. You will fill those in later.)
present state | new state | ||||||||
---|---|---|---|---|---|---|---|---|---|
x | A | B | z | A | B | JA | JB | KA | KB |
0 | 0 | 0 | 1 | 0 | 1 | ||||
0 | 0 | 1 | 0 | 1 | 0 | ||||
0 | 1 | 0 | 0 | 0 | 0 | ||||
0 | 1 | 1 | 1 | 1 | 1 | ||||
1 | 0 | 0 | 0 | 0 | 1 | ||||
1 | 0 | 1 | 0 | 1 | 1 | ||||
1 | 1 | 0 | 1 | 0 | 1 | ||||
1 | 1 | 1 | 1 | 0 | 1 |
Suppose two JK flip-flops are used to hold the state variables A and B. Fill in the four columns on the right of the table above for the inputs JA, KA, JB, and KB to these two flip-flops.
Fill in Karnaugh maps for the JA and KA inputs to the JK flip-flop for A.
According to the Karnaugh map method of simplifying sum-of-products implementations, what Boolean functions should be used to compute JA and KA?
Draw the combinational circuits for computing JA and KA. If you can't fit the circuit in this space, you probably have the wrong answer.