Computer Science 150 Homework Assignment 5
Spring 1998
Due: Thursday, March 19, 5:00 pm
The numbers in brackets [ ] denote the relative marks assigned for each
question.
(1) Does the following state diagram have any equivalent
states?
(a) Use an implication table to reduce machine
to a minimum number of states. [15]
(b) Draw a state transition graph for the reduced
machine. [10]
(2) Design a variation of the common binary counter that
counts only odd numbers.
The counter counts in the cyclic pattern: 1, 3, 5,
7, 1, 3, 5, 7, 1, 3, etc…
Show the original state table[5], state reduction[10],
adjacency constraints and optimal state assignment[10], and all
logic minimization steps.
-
Use positive edge-triggered D flip flops and show
minimized equations for all final logic [15]
-
Use positive edge-triggered JK flip-flops and show
minimized equations for all final logic[15]
3 Consider the conventional D latch circuit
below left and the alternative circuit shown on the right:
Fig. 1: Conventional D Latch
Fig. 2: Alternative Circuit
(a) Prove that the circuit of Fig.2 is
functionally equivalent to that of Fig. 1. [10]
(b) In what way(s) is the circuit of Fig.
2 actually better from the standpoint of practical use? List all possible
reasons that it is better. [10]