HW2 - EE 2301 INTRODUCTION TO DIGITAL SYSTEMS DESIGN...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE 2301 S 2010 INTRODUCTION TO DIGITAL SYSTEMS DESIGN HOMEWORK #2 (20 pts) Due Feb. 16, 2010 1. Simplify using algebraic manipulations: (a) a’ (b’ + c) + a + bc’ (b) a b + a’ b c’ + bc (c) z (x’ + y) (x’ y + z) (d) w’ x’ (y’ + z) + w x’ (y + z’) (y’ + z) (e) A’C’D’ + AC’ + BCD + A’CD’ + A’BC + AB’C’ 2. (a) Convert the following expression into SOP form by multiplying out: (A + B + C’) (A + B + D) ( A + B + E) ( A + D’ + E) (A’ + C) (b) Convert the following expression into POS form by factoring: AC + A’ B D’ + A’ B E + A’ C’ D E 3. Problem 3.32 4. (a) Algebraically show that NAND is not associative. (b) Algebraically show that z(x y) = zx zy 5. (a) Given two Boolean functions F 1 and F 2 of the same 5 Boolean variables : F 1 = m (1,6,30) and F 2 = m (1,6,7,8,30) Find the minterm expansion for ( F 1 + F 2 )’ (b) Given two Boolean functions F 1 and F 2 of the same 5 Boolean variables : F 1 = M
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/04/2010 for the course EE 2301 taught by Professor Larrykinney during the Spring '09 term at Minnesota.

Page1 / 3

HW2 - EE 2301 INTRODUCTION TO DIGITAL SYSTEMS DESIGN...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online