Scribd
Upload
80 views

Number System

Boolean algebra is used to design digital circuits and describe the relationships between inputs and outputs of a circuit. It uses variables that can have one of two values, true or false (1 or 0). The basic logical operators are AND, OR, and NOT. A truth table represents all possible input combinations and the corresponding outputs. Boolean algebra laws include identities, complementation theorems, properties of AND and OR, commutative, associative, and distributive laws, and De Morgan's laws. Key terms include literals, product terms, sum terms, min terms, max terms, sum of products, and product of sums.

Uploaded by

Shakku Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
80 views

Number System

Boolean algebra is used to design digital circuits and describe the relationships between inputs and outputs of a circuit. It uses variables that can have one of two values, true or false (1 or 0). The basic logical operators are AND, OR, and NOT. A truth table represents all possible input combinations and the corresponding outputs. Boolean algebra laws include identities, complementation theorems, properties of AND and OR, commutative, associative, and distributive laws, and De Morgan's laws. Key terms include literals, product terms, sum terms, min terms, max terms, sum of products, and product of sums.

Uploaded by

Shakku Gupta
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

BOOLEAN ALGEBRA Designing digital circuits Describes relation between inputs and outputs of a circuit Boolean Algebra makes

use of variables and operations ( functions ) A variable can have 2 values true or false ie. 0 or 1 OPERATIONS SYMBOLIC REPRESENTATION
AND OR NOT DOT PLUS SINGLE APOSTROPHE OR OVER BAR

Boolean Expression is a combination of Boolean Variables , Boolean Constants and the logical operators. No negative or fractional numbers in Boolean Algebra. Basic logical operators can be defined in the form of Equation Truth table Circuits A truth table represents all possible input values and output for each combination. Number of inputs = 2 where n represents number of inputs.

AND OPERATOR . OPERATOR Y = A.B Output is true only if all inputs are true. Truth Table
A 0 0 1 1 B 0 1 0 1 Y = A.B 0 0 0 1

OR OPERATOR + OPERATOR Y = A+B Output is true even if one input is true. Truth Table
A 0 0 1 1 B 0 1 0 1 Y = A+B 0 1 1 1

NOT OPERATOR OPERATOR Y=A Inverse of the input. Only one input Truth Table
A 0 1 Y=A 1 0

A 0 0 1 1

B 0 1 0 1

Y = A.B 1 1 1 0

NAND OPERATOR ( NOT AND )

B 0 1 0 1

Y = A+B 1 0 0 0

NOR OPERATOR ( NOT OR )

0 0 1 1

LAWS OF BOOLEAN ALGEBRA BOOLEAN IDENTITIES LAWS OF COMPLEMENTATION THEOREM 1 : If A = 0 then A = 1 THEOREM 2 : If A = 1 then A = 0 THEOREM 3 : Complement to complement A is A itself A = A PROPERTIES OF AND THEOREM 4 : A.1 = A THEOREM 5 : A.0 = 0 THEOREM 6 : A.A = A THEOREM 7 : A.A = 0

PROPERTIES OF OR THEOREM 8 : A + 1 = 1 THEOREM 9 : A + 0 = A THEOREM 10 : A + A = A THEOREM 11 : A + A = 1 COMMUTATIVE LAW THEOREM 12 : Addition and Multiplication is possible A+B=B+A AB = BA Subtraction is not possible ABBA

ASSOCIATIVE LAW THEOREM 13 : (A+B)+C = A+(B+C) = (A+C)+B ( AB ) C = A ( BC ) = ( AC ) B DISTRIBUTIVE LAW THEOREM 14 : A ( B + C ) = AB + AC A + ( B.C ) = ( A + B ) . ( A + C ) DE MORGANS LAW THEOREM 15 : A + B = A . B THEOREM 16 : AB = A + B

LITERAL : appearance of a variable or its complement in a Boolean Expression. PRODUCT TERM : is a term where one or more literals are connected by AND operator eg. AC , AC , B MIN TERM : is a Product term which includes all possible variables either complemented or uncomplemented . Eg. In a Boolean Expression of 3 variables XYZ the MIN TERM can be XYZ , XYZ , XYZ . It is also known as the Standard product term.

SUM TERM : One or more literals are connected with OR operator. Eg. A + B , A +B +C MAX TERM : Sum term is an expression which includes all possible variables in true or complementary form . Also called standard sum term Eg. In an expression of 3 variables XYZ MAX TERM can be X+Y+Z or X+Y+Z
SUM OF PRODUCTS One or more product terms connected by OR operator. Eg. A + AB + A B

PRODUCT OF SUMS : several SUM TERMS connected by AND operator Eg. ( A + B ) ( A + B )

You might also like