Unformatted text preview: minimum sum in (a), as in the minimum product in (c). 5. [5 points] Indicate which of the three circuits you prefer and why. 2. [5 points ] Design and implement in LogicWorks a circuit that has 5 switches as input, and one boolean probe (showing 0 or 1) as output. The output is to be 1 if and only if an odd number of the 5 switches are on. Use any available LW components that you wish. Print out the circuit, with your name. (One application of this circuit could be to generate a parity check bit.) Total: 30...
View Full Document
- Spring '08
- Boolean Algebra, Summation, Karnaugh map, Canonical form, minimum sum