The second midterm will cover the following topics:

• Given a word description of combinational logic problem, know how to specify the truth table.

• Know how 2's complement numbers are represented.

• Know how to build adders, subtractors, and ALUs.

• Know the difference between a Moore and a Mealy machine.

• Given a sequential circuit, know how to derive the state table.

• Given a state encoding, know how to derive the sequential circuit.

• Given a word description of a state machine problem, know how to design a state machine to implement the specified problem.

• Know if two states or two FSMs are equivalent in a completely specified FSM

• Know how to state minimize completely specified FSMs