This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ECE 211 HW 2 Solutions p 1 of 6 //home/vdimitrov/25330/91a9f0118ad1a0bf9591e573625e7aee98ab48ac.doc HW Set 2 – Solutions 1. Use DeMorgan’s Laws to obtain the negation of (A + B ' + C ) ⋅ ( A' + D ) ⋅ ( E' + F ) Solution: [ (A + B ' + C ) ⋅ ( A' + D ) ⋅ ( E' + F) ] ' = ( A + B' + C ) ' + ( A' + D )' + (E' + F )' = ( A' ⋅ B ⋅ C' ) + ( A ⋅ D' ) + ( E ⋅ F' ) ECE 211 HW 2 Solutions p 2 of 6 2. Use DeMorgan’s Laws to obtain the negation of (A' ⋅ B ⋅ C' ) + ( A ⋅ D' ) + [ F + ( G ⋅ H' ) ] Solution: { (A' ⋅ B ⋅ C' ) + ( A ⋅ D' ) + [ F + ( G ⋅ H' ) ] }' = (A' ⋅ B ⋅ C' )' ⋅ ( A ⋅ D' )' ⋅ [ F + ( G ⋅ H' ) ] ' = (A + B' + C) ⋅ (A' + D) ⋅ [ ( F' ) ⋅ (G H' )' ] = ( A + B' + C ) ⋅ (A' + D) ⋅ ( F' ) ⋅ (G' + H ) ] ECE 211 HW 2 Solutions p 3 of 6 3. Write a logic expression for E = "All 3bit subsets of the four bits b3, b2, b1, b0 have even parity." (One possible subset consists of the bits b3, b2 and b1. There are a total of four different 3bit subsets.)(One possible subset consists of the bits b3, b2 and b1....
View
Full
Document
This homework help was uploaded on 04/17/2008 for the course ECE 211 taught by Professor Nestor during the Fall '07 term at Lafayette.
 Fall '07
 nestor

Click to edit the document details