Boolean Algebra ~

CHAPTER

6
Q.1:
(i) (ii)

Boolean Algebra
)

Complete the following statements.

In Boolean algebra plus sign stands for AND operation is used for logical _ Double complementation has effect. In Boolean Algebra 1+1+1 is equal to _ According to the distributive law {A+(BC)} = . (ii) multiplication (v) (A+B).(A+C) _ operation.

(iii)
(iv) (v)

Answers:
(i) OR (iv) I (iii) cancellation

Q.2:

Tick the following statements either True or False.

i) ii). iii) iv) v) AND operation is also called as logical additionIn a NOT gate, the output is negative of the input Two series switches can represent AND operation. NOT of(A+B) is equal to NOT of A OR NOT ofB A variable that is same within two adjacent squares of a Karnaugh map is dropped. (ii) False (v) False (iii) True True/False True/False True/False True/False True/False

Answers:
(i) False (iv) True

Q.3: Encircle one choice A, B,C or 0 in each-case.

(i) , Boolean Algebra isalso known as a. Logical algebra b. Code Algebra c. Switching algebra d. Digital Algebra' (ii) An OR operation ha&A variables. The possible number of combinations in its truth table are:-

a. b.
c.

4
8
16

d.
(iii)

32

The- output will be one if all inputs except one are zero in case of:-

Star Key to Computer Science 9-10.(Federal Board)

a. b. c. d. (iv)

NOT operation AND operation OR operation NOT or OR law A + B is equal to:A+B A B

, /~

According to the Demogron's

a.
b.

(v)

c. AB d .. A+B According to absorption law A . (A+B) is equal to:-

a. b. c .. d. Answers: (i) C
(iv) C

1+B
AB A

A+1
(ii) C (iii) C -

(v) C

Q.4:

Match the items given in Column I with those given in Column II. i)
ii) iii) iv) v) Column AND OR A+A A+AB A + (A B) I a) b) c) d) e) Column 1 r A+B Union A
-;:-

II ,

Intersection

Answers:
(i) e (iv) b (ii) c (v) d (iii) a

.Q.5: What is Boolean algebra? Answer: .

-The Boolean algebra was developed by the English mathematician George Boole. It deals with statements in mathematical logic, and puts them in the form of algebraic equations. The Boolean algebra was further developed by the modern American mathematician Claude Shannon, in order to apply it to computers. The basic techniques described by Shannon were adopted almost universally for the design and analysis of switching circuits. Because of the analogous relationship between the actions of relays and of modern electronic circuits, the same techniques

Boolean Algebra ~

which were developed for the design of relay circuits are still being used in the design. of mode~n high speed computers. Thus the Boolean algebra founds its applications in modem computers after almost one hundred years of its discovery. Boolean algebra provides an economical and straightforward approach to the design of relay and other types of switching circuits. J4<;t as an ordinary algebraic expression. may be simplified by means of the basiq theorems, the expression describing a given switching circuit network may also be reduced or simplified using Boolean algebra. _. Boolean algebra is used in designing of logic circuits inside the computer. These circuits perform different types of logical operations. Thus, Boolean algebra is also known as logical algebra or switching algebra. The mathematical expressions of the Boolean algebra are .called Boolean expressions. Boolean algebra describes the Boolean expressions used in the logic circuits. The Boolean expressions are simplified by means of basic theorems. The expressions that describe the . logic circuits are also simplified by using Boolean theorems. . Boolean algebra is now being used extensively in designing the circuitry used in computers. In short, kriowledge of Boolean algebra is must in the computing field.

Q.6: What do understand Answer: AND OPERATION

by the logical operations AND or OR.

In Boolean algebra AND operator is represented by a dot or by the absence of any symbol between the two variables arid is used for .logical multiplication. For example A . B = X OR A B = X Thus X is 1 if both A and B are equal to I otherwise X will be 0 if either or both A and Hare 0 i.e.

I. I = 1 I .0= 0
.0. I

=0

0.0=0 OR OPERATION
OR operation is represented by a plus sign between-two variables. In Boolean algebra OR is used for logical addition. For example A + B = X The resulting variable X assumes the value 0 only when both A and Bare 0, otherwise X will be I if either or both of A and B are I i.e. .

1'+I~1 1 +0 = 1 0+1=1 0+0=0

Star Key to Computer Science 9-10 (Federal Board)

,

Q.7: Find the values of theBoolean expressions. Answer: i). 'xv + XY When X = I and Y = 0 . == (1. 0 ) +' ( I. I ) = 0+1 = 1 (X + Y) . ( X Y) When X = I and Y = 0 ' ii) (1 + 0) . (I . 0) = 1.0
I

= 0
iii) (X + Y) . (X + Y) When X = I and Y (1+0).(0+1) 1. I

=I

=.

1
, ,
,

State and prove the .two basic Demogran's theorem. Find out the complement of the following Boolean'expressions. Answer: ' . DEMORGAN'S LAW: --(a) AB = AB (b) AB = A+B
Q.S: a) AB
"\..

== AB'.
LHS = A+B = A+B = AB =R.H.S. L.H.S. = AS =A. (by duality principle)

Proof: (a)

(b)

S,

(by duality principle)

= A+B'
=R.H.S. Complements of BooJeanExpressions if XY +XY =(X+Y).(x+Y)
ii) (X

+Y ) .(X Y )
=(X,. Y)+(X+Y)

..

iii)

(X + Y) .

ex +Y)
. =

(X . 'Y)

+ ('

x . Y),

What is a Truth Table? Construct a truth table for AND or NOT of . AND operation for the three variables X, Yand Z. Answer: Q.9: TRUTH TABLE
A truth table is table that shows the result of a Boolean expression for all the possible combinations of the values given to the variables relater by some operator in the expression. For example, the truth "tables for operations AND, OR and NOT given below clearly define these operators.

AND OPERATION
.A B X=AB A

OR OPERATION
B X=A+B

NOT OPERATION

0 0 1 1

0 1 0 1

0 0 0 1.

0 0 1
1

0 1 0 1

0 1
1

~ I
F=X+Y+Z 0 1 1 .1 1 1 1 1

X~AI

Truth tabl e for OR opera fIon X Y 0 O. 0 . 0 0 1 0 1 " 0 1 1 0 1 1 1 1 Truth table ror AND opera tlIon X 0 0 0 0 ~ 1 1 1 1

Z 0 1 0 1 0

0 1

Y 0 0 1 1 0 0 1 1

Z 0 1 0 1 0 1 0 1

F=X. Y.Z 0 0 0 0 0 . I 0 0 1

Star Key to Computer Science 9-10 (Federal Board)

0f

Truth tabl e tior NOT X

/ (j

AND operation
,

Y 0

0 0 0 -I
~

o .
-,

I I 0 0 1 I

Z 0 I' 0 I 0, I O I

NOT F='X. 'Y . 'Z I I I 0 f .. 0 0 I 0

Q.10: State and prove the following laws: .' (i) Idempotent Law' (ii) Involution Law (iii) Absorption Law Answer: (I) IDEMPOTENT LA W (a) A + A = A (b) A . A =A Proof: (a) L.H.S. =A+A

= (A + A) . 1 [by axiom 1 (b)] = (A + A) . (A + A) [by axiom 5 (aj]

= A + (A A) [by axiom 4 (b)]

= A +0 [by axiom 5 (b)] = A' [by axiom I (a)] .

=R.H.S. (b) L.H.S. =A A
=AA

[by axiom I (aj] =AA+A.A [by axiom 5 (b)] = A . (A + ,A) [by axiom 4 (a)] = A . I [by axiom'S (a)] = A [by axiom I (b)] =R.H.S. . (II) INVOLUTION LAW It states that double complementation has cancellation effect. This. can be proved by the method of perfect induction as shown in truth table below. In this method a relation is checked by a truth table.

=A .A +0

Boolean Algebra

I!!l..

Truth Table

(III) ABSORPTION LAW (a)A+(AB)=A (b)A(A+B)=A Proof: (a) L.H.S. = A + (A . B) = (A 1) + (A B) [by axiom 1 (b)] = A ) (l + B) [by axiom 4 (a)] =A.1 [by theorem 2 (a)] .= A [by axiom 1 (b)] =R.RS. (b) L.H.S.

= A . (A+ B) = (A +0) . (A + B) . [by axiom 1 on

= A of: (0 B) [by axiom 4 (b)]

=A+0 [by theorem 2 (b)] = A [by axiom 1 (a)]=A
=R.H.S. Q.11: Construct a truth table for the followinsj ~oolean expre!sion. (i)XY+ XZ+YZ (ii)(X+ (XY) . (iii)XY +XZ+YZ

vr.
'XZ 0 1 0 1 0 0 0 1

Answer: (i) XY + X Z + YZ

x
0

Y 0 1 1 0 '0
1

Z 1 0 1 0 1 0 1

O 0

0
0 0 1 1 1 1

.1

'X 1 1 1 1 0 0 0 . 0

XY 0

O
0 0 0 0
1 1

YZ F=XY + 'XZ + YZ 0 0 1 I 0 ~. 0 0 1 1 ,0 0 0 0 1 0 1 1
..

64

Star Key to Computer Science 9-10 (Federal Board)

(ii) (X + Y) . (XY)

-X
0 0 1 1 (iii) X Y + XZ + Y Z X 0 0 0 Y 0 0
1 ~1 -

Y 0 1 0 1

X+Y' O. 1 1
1

XY 0 0 0 1

F=( X + Y ) . ( XY ) 0 0 0 1

'Y
1 .1

Z 0 1 0 1 0 1 0
1

'z
1 0 1 0
1

X'Y 0 ,0 0 0
1 1

XZ 0 0 0 0 0
1

Y'Z 0 0
1.

X'Y + XZ + Y"Z 0 0
1

0 0
1 1

0
1

0 0 0 1 0

0
1 1 1 1

0 0 1 1

1 1 1

0 1 0

0 0

0 1

.0

Q.12~ Simpli~the fol~~ing Boolea~expressi~. _ (i) A C + A.B + ABC + BC (ii) X Y Z +X Y Z + X Y Z +, X Y Z (iii)(A + B + C) . (A + B + C) . (A + B + C) . (A + B + C) . Answer:
(l) A C + A.B + ABC + BC . -

= A C + A B + C (A B + B)
-

= AC+ AB+C {(B+A). (B+B)} = A C + A-B + C (B + A) : 1 = A C + A B + C (B + A) = A C + A B + BC + AC. =C(A +B+A)+ =C(A +A+B)+ =C(l +B)+ AB =C.l+AB =C+'AB
-

AB AB.

Bo~lean Algebra ~

(ii) X Y Z +

=XYZ+XYZ+XYZ+XYZ = Y Z (X + X ) + Y -=YZ(I)+YZ(l),-= YZ+Y Z = Y(Z+Z)

x Y -Z + x YZ+ x Y Z --- --Z

(X + X

=
iii)

Y (I)

=Y (A.RC). ( A.Iic). Let A+B =0 A+'B=E ( A.B.C). (A.R.C )

,= (D+C).(D+C ).(E+C ).(E+C) According to Distributive Law A+B.C=(A+B).(A+C) therefore = (D+C. C ).(E+ C .C) = (D+O).(E+O) = D.E, By putting the value of 0 and E (A+B).(A+ B) , A+B. B

"-

A+o

= A
Q.13: Simplify the following function using karnaugh map.
(i) ABC (iii) ABC

.-+ ABC + B C + ABC

+ ABC

(ii) ABC + AB C + ABC (iv)AB +-AC+BC

--

Answer:
(i) ABC

+ j_C_+_:_C--+

-I-

_'__ 1

-+1

= B C +AC (ii) ABC + A..:;:B_C=--+-=-AB=-C~r----=---_-'------rr--'-----' _

-I

I-II'

"

66

Star Key to Computer Science 9-10 (Federal Board)

"

=AB+AC (iii) ABC + ABC + ABC

I
=B\C+ABC (iv) A B + A C + B C

I
\

I
AB+AC+B'

"