{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Topic 2 Boolean Algebra

# Topic 2 Boolean Algebra - Outline Fundamental Boolean...

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

Topic 2 Boolean Algebra Akash Kumar Outline Fundamental Boolean operations Deriving logic expressions from truth tables SOP and POS expressions Rules for deriving SOP and POS expressions Boolean Identities Simplifying logic expressions using Boolean identities Karnaugh maps Obtaining MSOP’s and MPOS’s from K-maps Don’t care conditions 2 Boolean Algebra Boolean algebra is the basic math used in digital circuits and computers. A Boolean variable takes on only 2 values: {0,1} , {T,F}, {Yes, No}, etc. There are 3 fundamental Boolean operations: AND, OR, NOT 3 Fundamental Boolean Operations AND OR NOT Z=A*B (AB) Z=A+B Z= Ā Truth Table Truth Table Truth Table A B Z A B Z Z A A B Z 0 0 0 0 1 0 1 0 0 1 1 1 A B Z 0 0 0 0 1 1 1 0 1 1 1 1 A Z 0 1 1 0 5

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

View Full Document