The second midterm will cover the following topics:

• Know how 2's complement numbers are represented.

• Know how to build ripple carry, carry select, and carry lookahead adders, and know the delay paths through these adders and why one adder is faster than the other.

• Know how to build adders and subtractors.

• Know how to identify critical paths in a combinational logic circuit and how to compute the critical delay.

• 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 problem, know how to design a state machine to implement the specified problem.