Final Exam

The final exam will cover all the topics from midterm 1 and midterm 2, plus state minimization:

From Midterm 1

Know how to translate word problems into truth tables.
Two-level logic minimization
- Finding prime implicants (PI)
- Finding essential prime implicants (EPI)
- Finding a minimum cover
Finding PI's, EPI's, and a minimum cover with don't care outputs.
Know that two-level logic can be implemented using NAND/NAND or NOR/NOR instead of AND-OR.
Given a two-level function (e.g. as a K-map), find a minimum hazard-free logic implementation. Consider only static hazards.
Minimizing multi-level logic implementations (e.g. by identifying common subexpressions).

From Midterm 2

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.

Since Midterm 2