'Outputs binary sum cs' diaporamas de présentation

R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001

R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001. Chapter 9 Boolean Algebras and Combinatorial Circuits. A bit is a 0 or a 1. Input x 1 , x 2 can be 0 or 1 ------------------------------------------- Conjunction: AND x 1 ? x 2 = 1 if x 1 = x 2 = 1

432 views • 31 slides