Exam 2 Review 91509 L 24 Other FF

Exam 2 topics o o o o Minimal sum-of-products K-maps AND-OR equivalence with NAND-NAND

Minimal Sum-of-Products/K-maps o o Be able to go from a K-map to a minimal

AND-OR and NAND-NAND o o Know the equivalence of AND-OR with NAND-NAND Be capable

ADDERS o Know what a half-adder is n o Know its circuit Know what

Flip-flops o o Know the SR flip-flop Know the SR latch Know the D

Sequential circuits o Know how to analyze a sequential circuit. n n n o

Slides: 7

Download presentation

Exam 2 topics o o o o Minimal sum-of-products K-maps AND-OR equivalence with NAND-NAND Multipexers Adders Flip-flops Sequential Circuit Analysis 9/15/09 - L 24 Other FF Types Copyright 2009 - Joanne De. Groat, ECE, OSU 2

Minimal Sum-of-Products/K-maps o o Be able to go from a K-map to a minimal sum -of-products representation of the function. Can do this for 2 variables, 3 variables, 4 variables 9/15/09 - L 24 Other FF Types Copyright 2009 - Joanne De. Groat, ECE, OSU 3

AND-OR and NAND-NAND o o Know the equivalence of AND-OR with NAND-NAND Be capable of generating an AND-OR gate circuit from and expression, and then convert that AND-OR implementation into a NAND circuit. 9/15/09 - L 24 Other FF Types Copyright 2009 - Joanne De. Groat, ECE, OSU 4

ADDERS o Know what a half-adder is n o Know its circuit Know what a full-adder is n n Know the circuit for a full adder (AND-OR) Be able to construct a full adder from half adders 9/15/09 - L 24 Other FF Types Copyright 2009 - Joanne De. Groat, ECE, OSU 5

Sequential circuits o Know how to analyze a sequential circuit. n n n o Be able to generate the next state equations Be able to generate a state table from these equations Be able to generate a state diagram from a state table Know the definition and difference of a Mealy machine from a Moore machine. 9/15/09 - L 24 Other FF Types Copyright 2009 - Joanne De. Groat, ECE, OSU 7