Scribd
Upload
52 views5 pages

CHAPTER 3 Boolean Logic

Chapter 3 covers Boolean logic, defining key concepts such as truth values, logical functions, tautology, and fallacy. It explains De-Morgan's theorems and provides algebraic proofs for both theorems. The chapter also includes exercises related to truth tables and complements of Boolean expressions.

Uploaded by

dragongungaming7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
52 views5 pages

CHAPTER 3 Boolean Logic

Chapter 3 covers Boolean logic, defining key concepts such as truth values, logical functions, tautology, and fallacy. It explains De-Morgan's theorems and provides algebraic proofs for both theorems. The chapter also includes exercises related to truth tables and complements of Boolean expressions.

Uploaded by

dragongungaming7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

CHAPTER 3

BOOLEAN LOGIC
1. What do you understand by 'truth value' and 'truth function'? How
are these related ?

Sentences which can be determined to be true or false are called


logical statements or truth functions and The results TRUE or FALSE are
called Truth values.
2. What do you understand by 'logical function'? What is its
alternative name? Give examples for logical functions.

Logical statements or truth functions are combined with the help of


Logical Operators like:- AND, OR and NOT to form a Compound statement
or Logical function.
e.g.,
• He prefers tea not coffee.
• He plays guitar and she plays sitar.
• I watch TV on Sundays or I go for swimming.
3. What is meant by tautology and fallacy? Prove that 1+Y is a
tautology and 0.Y is a fallacy.
Tautology:- If the result of any logical statement or expression is
always TRUE or 1 for all input combinations, it is called Tautology.

Fallacy:- If the result of any logical statement or expression is always


FALSE or 0 for all input combinations, it is called Fallacy.

• If we put value of Y = 0 or 1 in 1+Y, then result is always 1that's


why this is tautology.
• If we put value of Y = 0 or 1 in 1.Y, then result is always 1that's why
this is fallacy
4. What is a truth table? What is its significance?

A Truth Table is a table which represents all the possible values of


logical variables / statements along with all the possible results of the given
combinations of values.

Q.no 5-10 not in portion

11. What are De-Morgan's theorems ? Prove algebraically the De-


Morgan's theorem.

One of the most powerful identities used in Boolean logic is De-Morgan's


theorem. Augustus De-Morgan had paved the way to Boolean logic by
discovering these two important theorems This section introduces these two
theorems of De-Morgan.

(i) (X + Y)’= X’.Y’

Now to prove De-Morgan’s first theorem, we will use complementarity laws.


Let us assume that P = x + Y where, P, X, Y are logical variables. Then,
according to complementation law

P + P’ =1 and P . P’= 0

That means, if P, X, Y are Boolean variables hen this complementarity law


must hold for variables P. In other words, if P i.e., if (X + Y)’= X’.Y’then

(X + Y) + (XY)’must be equal to 1. (as X + X’= 1)


and (X + Y) . (XY)’must be equal to 0. (as X . X’= 0)

Let us prove the first part, i.e.,

X + Y) + (XY)’ = 1

(X + Y) + (XY)’= ((X + Y) +X’).((X + Y) +Y’) (ref. X + YZ = (X + Y)(X + Z))

= (X + X’+ Y).(X + Y +Y’)


= (1 + Y).(X + 1) (ref. X + X’=1)
= 1.1 (ref. 1 + X' =1)
= 1

So first part is proved.

Now let us prove the second part i.e.,

(X + Y).(XY)’= 0
(X + Y) . (XY)’ = (XY)’.(X + Y) (ref. X(YZ)= (XY)Z)
= (XY)’X + (XY)’Y (ref. X(Y + Z) = XY + XZ)
= X(XY)’ + X’YY’
= 0 .Y + X’ . 0 (ref. X . X’=0)
=0+0
=0

So, second part is also proved, Thus: X + Y = X’ . Y

(ii) (X.Y)’= X’ + Y’

Again to prove this theorem, we will make use of complementary law i.e.,
X + X’= 1 and X . X’= 0
If XY’s complement is X + Y then it must be true that
(a) XY + (X’+ Y’) = 1
(b) XY(X’+ Y’) = 0

To prove the first part

L.H.S = XY + (X’+Y’)
= (X’+Y’) + XY (ref. X + Y = Y + X)
= (X’+Y’ + X).(X’+Y’ + Y) (ref. X + YZ = (X + Y)(X + Z))

= (X + X’+Y’).(X’ + Y +Y’)
= (1 +Y’).(X’ + 1) (ref. X + X’=1)
= 1.1 (ref. 1 + X =1)
= 1
= R.H.S

Now the second part i.e.,


XY.(X + Y) = 0

L.H.S = (XY)’.(X’+Y’)
= XYX’ + XYY’ (ref. X(Y + Z) = XY + XZ)
= XX’Y + XYY’
= 0.Y + X.0 (ref. X . X’=0)
= 0 + 0 = 0 = R.H.S.
XY.(X’ + Y’)= 0
and XY + (Xʹ +Y’) = 1
(XY)’= X’ + Y’. Hence proved

Q.no 12-15 not in portion

16.Pg.72 Table 3.31 & 3.32

17.Pg.71 Table 3.29 & 3.30

18.Pg.73 Table 3.33 & 3.34

19.Pg.74 Table 3.35 & 3.36

20.Pg.74

TYPE B

1. pg.56
2. pg.57
3. give truth table for the boolean expression (x+y')'
4. Draw the truth table for the following equations : (a) M = N (P + R) (b) M = N + P + NP’

5. Using Truth table prove that AB+BC+CA'=AB+CA'

Q.no 6-8 not in portion

9. What would be the complement of the following:

a) A’(BC’+B’C) b) xy+y’z+z’z

10. Find the complement of the following Boolean function :

F1 = AB’ + C’D’
11. Find the complement of the following Boolean expression:

(A+B’+C) (A+B’C)
Answer: a'.b.c' + a'.(b+c')
Explanation:
{(a+b'+c).(a+b'c)}'
= { (a+b'+c)' + ((a + (b'.c))' } [ apply demorgan law a'. b' = a' + b']
= { ( a'.b''.c' ) + ( a' .( b'.c)' ) } [ apply demorgan law again ]
= ( a'.b.c' ) + ( a'.(b''+c')) [ apply involution law a'' = a ]
= ( a'.b.c') + (a'.(b + c'))

You might also like