February 23, 2009
Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16
Digital Electronics Logic “Gates” Just Boolean Algebra! ANDNAND (NOT AND) ORNOR (NOT OR) XOR (Inequality) XNOR (NOT XOR) (Tests equality) NOT
Try it out Find all ordered triples that make this circuit true.
Solution Convert to boolean algebra: (A XOR B) XOR (B OR C) Truth table: Evaluate each part individually
More challenging Find all gates (AND/OR/NAND/NOR/XOR/XNOR) that can replace the “X” such that only one tuple makes the circuit true.
Solution