tutLN3soln

# tutLN3soln - FIT1001 Solutions to FIT1001 Tutorials for LN3...

This preview shows pages 1–3. Sign up to view the full content.

FIT1001 Digital Logic Solutions to FIT1001 Tutorials for LN3 Digital Logic Digital Logic – Introduction (* Important to complete) * Exercise 1 Apply Boolean algebra identities to simplify the following Boolean function: ( AB ) A + A ¯ B SOLUTION: De Morgan ( ¯ A + ¯ B ) A + A ¯ B Commutative A ( ¯ A + ¯ B ) + A ¯ B Distributive A ¯ A + A ¯ B + A ¯ B Inverse 0 + A ¯ B + A ¯ B Identity A ¯ B + A ¯ B Idempotent A ¯ B Exercise 2 Show that xy = ( x + y )( x + ¯ y )(¯ x + y ), using (a) a truth table SOLUTION: x y x + y x + ¯ y ¯ x + y ( x + y )( x + ¯ y )(¯ x + y ) xy 0 0 0 1 1 0 0 0 1 1 0 1 0 0 1 0 1 1 0 0 0 1 1 1 1 1 1 1 (b) Boolean identities SOLUTION: Distributive ( x + y ¯ y )(¯ x + y ) Inverse ( x + 0)(¯ x + y ) Identity x x + y ) Distributive x ¯ x + xy Inverse 0 + xy Identity xy 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
* Exercise 3 Using the gates AND, OR and NOT, design a circuit that takes three binary digits as input, and outputs 1 if an odd number of these digits is 1, and 0 otherwise. That is, the circuit outputs 1 if there is one 1 and two 0s, or three 1s. Otherwise it outputs 0. SOLUTION: Truth table x y z output 0 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 1 1 1 1 Sum of products: ¯ x ¯ yz + ¯ xy ¯ z + x ¯ y ¯ z + xyz * Exercise 4 Using the gates NOT, OR, AND and XOR, construct a digital logic circuit to perform the
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 08/15/2010 for the course FIT 1001 taught by Professor Egerton during the Three '10 term at Monash.

### Page1 / 7

tutLN3soln - FIT1001 Solutions to FIT1001 Tutorials for LN3...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online