Digital Systems Exam Makeup
1. You have a LM-EF that works as follows.
If LM = 00 then Q* =1
If LM = 01 then Q* = Q
If LM = 10 then Q* = Q'
If LM = 11 then Q* = O.
Create the LM-FF using a T-FE.
2. Construct the state table for a circuit that has 2 flip-flops.
3. Design a BCD (decimal digits from 0 to 9) counter. The BCD number is a 4-bit number KLMN. K is a D-FF, L is a T-FF, M is a JK-FF and N is a SR-FF.
4. Create a Moore FSM that has one Input and one output. The output is 1 If and only if both of the following conditions are met:
a) The Input sequence contains exactly two groups of 1's and
b) Each of these groups contains exactly two 1's.
Each group of l's must be separated by at least one 0. A single 1 Is considered a group of 1's containing one 1.
5. Create a mealy state machine. Your Input Is 2-bits that tells a color. (00-Red, 01-Blue, 10-Green, 11-Yellow). You need to detect two outputs. Z1 = 1 when you have seen the pattern Red, Blue, Blue, Green. The output Z2 =1 when the pattern Blue, Blue, Yellow, Yellow has occurred.
6. Reduce the following state table.
|
|
X=0
|
X=1
|
Z
|
|
A
|
A
|
B
|
1
|
|
B
|
C
|
E
|
0
|
|
C
|
F
|
G
|
1
|
|
D
|
C
|
A
|
0
|
|
E
|
I
|
G
|
1
|
|
F
|
H
|
I
|
1
|
|
G
|
C
|
F
|
0
|
|
H
|
F
|
B
|
1
|
|
I
|
C
|
E
|
0
|
7. Using the reduced state table from problem 6, implement the table using JK-FFs.=