Proposition

logic
implementation of true and false

Premise- simple logical statement

EVERY THING IS CREATED BY SOME ONE.- TRUE

A=HUMAN BEING IS A CREATION.- TRUE
B= if ONE CREATES then he/she IS GOD OF HIS CREATION.- TRUE
C=HUMAN BEING IS CREATED BY GOD.

A AND B =C
TRUE AND TRUE= TRUE
WHO CREATED GOD.
GOD IS A CREATION.
GOD IS THE CREATOR OF GOD.
 THE ONE WHO HAS CREATED HUMAN BEING IS GOD.

BASIC LOGIC GATES

And ( . & ^ )
OR ( + | V )

NOT(~A ¬ A A’ A )

A- I AM AN ADULT.
A’- I AM NOT AN ADULT.

A A’ (A’)’

0 1 0

1 0 1

A= I HAVE AN UMBRELLA.
B= I HAVE A RAINCOAT.

2n
C=I WILL BE DRY
A+B (AᴠB) (A OR B)
 A B C= A+B

0 0 0

0 1 1

1 0 1

1 1 1

22=4

A= I AM AN INDIAN.
B= I AM 18 YEARS OR ABOVE IN AGE.
C=I HAVE THE RIGHT TO VOTE IN INDIA.
A.B(A^B) (A AND B)

A B C= A , B

0 0 0

0 1 0

1 0 0

1 1 1

Premise
Proposition
What is a Proposition?
A Proposition is sentence that can either be TRUE or
FALSE and nothing else.

Following sentences are example of proposition.

Proposition: India is a country.

Result: TRUE

Proposition: 100 is greater than 200

Result: FALSE

Tautology
Fallacy
Contingency

A= the student is a GIRL.

A+1=1 (TAUTOLOGY)

A 1 A+1

0 1 1

1 1 1

A.0=A (CONTRADICTION/ FALLACY)

A 0 A.0=0

0 0 0

1 0 0

A.1=A (CONTINGENCY)
 A 1 A.1

0 1 0

1 1 1

B= You study in KSMS.

You are a GIRL and you study in KSMS. (A.B)
It is not true that “You are a GIRL and you don’t study in KSMS”.

(a.b’)’

(A.B)’
Derived Gates
NAND
NOR
XOR
XNOR
NAND= NOT (AND)

A B A.B (A.B)’

0 0 0 1

0 1 0 1

1 0 0 1

1 1 1 0

NOR= NOT OF OR

A B A+B (A+B)’
 0 0 0 1

0 1 1 0

1 0 1 0

1 1 1 0

XOR (EXCLUSIVE OR)

A XOR gate (also known as an EXOR gate) – pronounced as Exclusive OR gate – is a digital logic gate that gives a true (i.e. a
HIGH or 1) output if ODD number of inputs is true,

XOR represents the inequality function, i.e. the output is true if the inputs are not alike; otherwise, the output is false. A
common way to remember the XOR is “must have one or the other, but not both”.

A B A⊕ B A⊕ B

0 0 0 1

0 1 1 0
A’B

1 0 1 0
A.B’

1 1 0 1

(A⊕B)’

A⊕ B= A’B+AB’

A⊕ B= A’B’+AB
The above expression, A ⊕ B can be simplified as,

A ⊕ B = (A. B’) + (A’ . B)

A B A’ B’ A.B’ A’.B A.B’ + A’.B A⊕B

0 0 1 1 0 0 0 0

0 1 1 0 0 1 1 1

1 0 0 1 1 0 1 1

1 1 0 0 0 0 0 0

Logical symbol of XOR Gate

A XOR gate is logically expressed as

Syllogism
The logical process of finding conclusions from given
propositions is called syllogism the propositions used
to draw conclusion are called the premises.

We can use two methods to draw conclusion, Truth

Table Method and Algebraic Method.

Truth Table Method

In this method we draw a truth table for the premises
and the conclusion.

We prepare a conditional whose antecedent is the

conjunction of all the given premises and consequent
is the conclusion to be drawn. If the conditional
results in a tautology (i.e., all 1s or True) then the
conclusion is established.

Lets see few examples to understand this :-)

From the given premises (p and p ⇒ q) infer q.

So, we have two premises p and p ⇒ q. connected by
an AND operator and the conclusion to be drawn is q.
So we have to create a conditional

P=>Q, if P is true then Q is true

P= antecedent

Q= consequence

If I take admission in KSMS then I am allowed to enter

KSMS.

P Q P=>Q

0 0 1

0 1 1

1 0 0

1 1 1
(p and p ⇒ q) infer q

( p . (p ⇒ ⇒ q) ) q
where, . is the AND operator,
⇒ is the conditional operator

So we have to prove ( p . (p ⇒ q) ) ⇒ q is a tautology.

p q P=>Q p . (p ⇒ ( p . (p ⇒ q) )
⇒q
q)

0 0 1 0 1

0 1 1 0 1

1 0 0 0 1

1 1 1 1 1

Truth table

If and only if p is true then q is true

If and only if Orange provides VitC then Gooseberry

provides VitC.

p q p⇒q Pq
0 0 1 1

0 1 1 0

1 0 0 0

1 1 1 1
So, ( p . (p ⇒ ⇒ q) ) q
is a tautology. Hence the conclusion from the given
premises can be drawn.

Lets check another example.

From the given premises x or ~x ⇒ y infer x.
so, we have two premises x and ~x ⇒ y connected
by an OR operator and the conclusion to be drawn is
x. So, we have to create a conditional
( x + (~x ⇒ y) ) ⇒ x
where, . is the AND operator,
+ is the OR operator,
~ is the NOT operator and
⇒ is the conditional operator

So, we have to prove ( x + (~x ⇒ y) ) ⇒ x is a tautology.

Truth table
So, ( x + (~x ⇒ y) ) ⇒ x is not a tautology and hence the
conclusion from the given premises can’t be drawn.

Now, we will talk about the Algebraic method.

Algebraic Method
In this method we use conditional elimination to draw
conclusion from given premises. We prepare a
conditional whose antecedent is the conjunction of all
the given premises and consequent is the conclusion
to be drawn. If the conditional results in a tautology
(i.e., all 1s or True) then the conclusion is established.

We substitute the conditional p ⇒ q with ~p + q

where, ~ is the NOT operator
+ is the OR operator

Lets see an example to understand this :-)

From the given premises p and p ⇒ q infer q.
So, we have two premises p and p ⇒ q connected by
an AND operator and the conclusion to be drawn is q.
So, we have to create a conditional
( p . (p ⇒ q) ) ⇒ q
where, . is the AND operator
⇒ is the conditional operator

So, we have to prove ( p . (p ⇒ q) ) ⇒ q is a tautology.

We have,
( p . (p ⇒ q) ) ⇒ q

= (p . (~p + q) ) ⇒ q from conditional elimination,

a ⇒ b = ~a + b

= (p . ~p) + (p . q) ⇒ q from distributive law,

a . (b + c) = (a . b) + (a . c)

= 0 + (p . q) ⇒ q from complementarity law,

a . (~a) = 0

= (p . q) ⇒ q from property of 0,
0+a=a

= ~(p . q) + q from conditional elimination,

a ⇒ b = ~a + b
 = (~p + ~q) + q from de morgan’s law,
~(a . b) = ~a + ~b

= ~p + (~q + q) from associative law,

(a + b) + c = a + (b + c)

= ~p + 1 from complementarity law,

(~a + a) = 1

=1 from property of 1,
~a + 1 = 1

So, ( p . (p ⇒ q) ) ⇒ q = 1 i.e., it is a tautology hence

conclusion can be drawn.

 ← Prev

 Next →

Share

XNOR (EXCLUSIVE OR)

A XOR gate (also known as an EXOR gate) – pronounced as Exclusive OR gate – is a digital logic gate that gives a true (i.e. a
HIGH or 1) output if ODD number of inputs is true,

XOR represents the inequality function, i.e. the output is true if the inputs are not alike; otherwise, the output is false. A
common way to remember the XOR is “must have one or the other, but not both”.

A B A⊕B
 0 0 0

0 1 1

1 0 1

1 1 0

09844547242
0989 9850

Boolean algebra is the branch of algebra wherein the values of the variables are either true or
false, generally denoted by 1 and 0 respectively. Whereas in elementary algebra we have the
values of the variables as numbers and primary operations are Addition and multiplication.
Let’s learn Boolean algebra laws in a simpler way.
Boolean Algebra Rules
Boolean algebra problems can be solved using these Boolean algebra laws. There are few
boolean algebra rules to be followed to while solving problems

2N
A 0 A+0=a
 0 0 0
1 0 1
A+0=A
A.0=0
A 0 A.0=0
0 0 0
1 0 0
a.1=a
A 1 A.1=A
0 1 0
1 1 1
a+1=1
A 1 A+ 1=1
0 1 1
1 1 1

A A A+ A=A A. A=A
0 0 0 0
1 1 1 1
N
2
A+B=B+A (commutative law)
A B A+B B+A
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1

A+B=B+A (Commutative Law)

Associative law a+(b+c)=(a+b)+c
A B C B+C A+(B+C) A+B (A+B)+C
0 0 0 0 0 0 0
0 0 1 1 1 0 1
0 1 0 1 1 1 1
0 1 1 1 1 1 1
1 0 0 0 1 1 1
1 0 1 1 1 1 1
1 1 0 1 1 1 1
1 1 1 1 1 1 1

A+(B+C)=(A+B)+C (ASSOCIATIVE LAW)

A 0 A. 0=0
0 0 0
1 0 0

A 1 A. 1=A
0 1 0
1 1 1

A 1 A+ 1=1
0 1 1
1 1 1
A 0 A+0=A
0 0 0
1 0 1

A A A+A=A
0 0 0
1 1 1

A A A.A=A
0 0 0
1 1 1
 A 1 A+ 1=1
0 1 1
1 1 1

A 0 A+0=A
0 0 0
1 0 1

Applications of Boolean Algebra

Examples of these particular laws of Boolean algebra, rules and theorems for Boolean
Algebra are given in the following table.
Solved problems – Using Boolean Algebra Laws
Example:
Using the above laws, we can simplify the given expression: (A + B)(A + C)

Truth table: is a table which represents all the possible values of logical variables along with all the possible results of the given
combinations of values.
List of axioms and theorems:

Identity A+0=A A. 1 = A

Complement A + A’ = 1 A. A’ = 0

Commutative A+B=B+A A. B = B. A

Assosiative A + (B + C) = (A + B) + C A. (B. C) = (A. B). C

Distributive A. (B + C) = A. B + A. C A + (B. C) = (A + B). (A + C)

Null Element A+1=1 A. 0 = 0

Involution (A’)’ = A

Indempotency A+A=A A. A = A

Absorption A + (A. B) = A A. (A + B) = A

3rd Distributive A + A’. B = A + B

De Morgan’s (A + B)’ = A’. B’ (A. B)’ = A’. B’

(Boolean Functions and Reduce Forms)

A Boolean function can be expressed algebraically from a given truth table by forming a minterm and then taking the OR of all
those terms.

Minterm: An n variable minterm is a product term with n literals resulting into 1.

Maxterm: An n variable maxterm is a sum term with n literals resulting into 0.
A sum-of-product expression is logical OR of two or more AND terms

A product-of-sum is logical AND of two or more OR terms

If each term in SOP / POS form contains all the literals, then it is canonical form of expression.
To convert from one canonical form to another, interchange the symbol and list those numbers missing from the original form.

The Karnaugh map (K-map) provides a systematic way of simplifying Boolean algebra expressions.

For minimizing a given expression in SOP form, after filling the k map look for combination of adjascent one’s.

Combine these one’s in such a way that the expression is minimum.

For minimizing expression in POS form we mark zeros, from the truth table, in the map. Combine zeros in such a way that the
expression is minimum.

Sum Term: is a single literal or the logical sum of two or more literals.
Product term: is a single literal or the logical product of two or more literals.
(Application of Boolean Logic)
Gate is an electronic system that performs a logical operation on a set of input signal(s). They are the building blocks of
Integrated Circuits.

An SOP expression when implemented as circuit – takes the output of one or more AND gates and OR’s them together to
create the final output.

An POS expression when implemented as circuit – takes the output of one or more OR gates and AND’s them together to
create the final output.

Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT, or any combination of these
basic gates; NAND and NOR gates are universal gates.

Implementation of a SOP expression using NAND gates only

1) All 1st level AND gates can be replaced by one NAND gate each.

2) The output of all 1st level NAND gate is fed into another NAND gate. This will realize the SOP expression

3) If there is any single literal in expression, feed its complement directly to 2nd level NAND gate. Similarly, POS using NOR gate
can be implemented by replacing NAND by NOR gate.

Implementation of POS / SOP expression using NAND / NOR gates only.

1) All literals in the first level gate will be fed in their complemented form.

2) Add an extra NAND / NOR gate after 2nd level gate to get the resultant output.

Question 1:
Derive a Canonical POS expression for a Boolean function G, represented by the following truth table: All India 2017
Answer:

Question 2:
Derive a canonical POS expression for a Boolean function F, represented by the following truth table: Delhi 2016

Answer:

Question 3:
Derive a canonical SOP expression for a boolean function G, represented by the following truth table: All India 2016
Answer:

Question 4:
Derive a canonical SOP expression for boolean function F, represented by the following truth table: Delhi 2015
Answer:

Question 5:
Derive a canonical POS expression for a boolean function F, represented by the following truth table: All India 2015

Answer:

Question 6:
Convert the following Boolean expression into its equivalent canonical sum of products (SOP) form:
Answer:

Question 7:
Write the Sum of Product form of the function F (P,Q,R) for the following truth table representation of F: Delhi 2014

Answer:

Question 8:
Write the Product of Sum form of the function F(X, Y, Z) for the following truth table representation of F: All India 2014
Answer:

Question 9:
Write the Product of Sum form of the function G(U, V, W) for the following truth table representation of G: Delhi 2013
Answer:

Question 10:
Write the Product of Sum form of the function G(U,V,W) for the following truth table representation of G: Delhi 2013C

Answer:

Question 11:
Write the Sum of Product form of the function F (A, B, C) for the following truth table representation of F: All India 2013
Answer:

Question 12:
Write the POS form of boolean function G, which is represented in a truth table as follows: Delhi 2012
Answer:

Question 13:
Write the SOP form of boolean function F, which is represented in a truth table as follows: All India 2012

Answer:

Question 14:
Write the POS form of a boolean function F, which is represented in a truth table as follows: Delhi 2011
Answer:

Question 15:
Write the SOP form of a boolean function F, which is represented in a truth table as follows: All India 2011

Answer:
Question 16:
Write the SOP form of a boolean function F, which is represented in a truth table as follows: Delhi (c) 2011

Answer:

Question 17:
Write the POS form of boolean function H, which is represented in a truth table as follows: Delhi 2010
Answer:

Question 18:
Write the SOP form of boolean function G, which is represented in a truth table as follows: All India 2010
Answer:

Question 19:
Write the POS form of a boolean function H, which is represented in a truth table as follows: Delhi 2009

Answer:

Question 20:
Write the POS form of a boolean function G, which is represented in a truth table as follows: All India 2009
Answer:

2 Marks Questions
Question 21:
State DeMorgan’s Laws of Boolean Algebra and verify them using truth table. All India 2017
Or
State DeMorgan’s laws. Verify one of the DeMorgan’s laws using a truth table Delhi 2013C
Or
State and prove DeMorgan’s laws in boolean algebra. Delhi 2011C,2009C

Answer:
Question 22:
Draw the Logic Circuit of the following Boolean Expression using only NOR Gates: All india 2017
(A+B). (C+D)
Answer:

Question 23:
Verify the following using boolean laws:

Answer:

Question 24:
Write the boolean expression for the result of the logic circuit as shown below:

Answer:
Question 25:
Verify the following using Boolean Laws:

Answer:

Question 26:
Write the boolean expression for the result of the Logic Circuit as shown below:

Answer:

Question 27:
Verify the following using boolean laws:

Answer:

Question 28:
Draw the logic circuit for the following boolean expression:
Answer:

Question 29:
Verify the following using boolean laws.

Answer:

Question 30:
Draw the logic circuit for the following boolean expression:

Answer:

Question 31:
State distributive law and verify it using truth table. All India 2014C
Answer:

Question 32:
Name the law shown below and verify it using a truth table.

Answer:
Question 33:
Obtain the boolean expression for the logic circuit shown below: Delhi 2014

Answer:

Question 34:
Name the law shown below and verify it using a truth table.

Answer:

Question 35:
Obtain the boolean expression for the logic circuit shown below: All India 2014

Answer:

Question 36:
Verify the following using boolean laws
Answer:

Question 37:
Verify the following using boolean laws

Answer:

Question 38:
Obtain the boolean expression for the logic circuit shown below:

Answer:

Question 39:
Draw a logic circuit for the following boolean expression.

Answer:
Question 40:
Obtain the boolean expression for the logic circuit shown below:.

Answer:

Question 41:
Verify the following boolean expression using truth table:

Answer:

Question 42:
Write the equivalent boolean expression for the following logic circuit:
Answer:

Question 43:
Verify the following boolean expression using truth table:

Answer:

Question 44:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 45:
Verify the following boolean expression using truth table:

Answer:
Question 46:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 47:
Verify the following boolean expression using truth table:
Answer:

Question 48:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 49:
Write the equivalent boolean expression for the following logic circuit:
Answer:

Question 50:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 51:
Verify the following algebraically:

Answer:

Question 52:
Verify the following algebraically:
Answer:

Question 53:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 54:
Write the equivalent boolean expression for the following logic circuit:.

Answer:

Question 55:
Answer:

Question 56:
Write the equivalent boolean expression for the following logic circuit:

Answer:

Question 57:

Answer:
Question 58:
State and verify absorption law in boolean algebra. All India 2009
Answer:

Question 1:
Which gates are known as universal gates ? Why?
Аnswer:
Universal gates are the ones which can be used for implementing any gate like AND, OR and NOT or any combination of these
basic gates. NAND and NOR gates are universal gates.

Question 2:
Draw the equivalent logic circuit for the following Boolean expression :
Аnswer:

Question 3:
Express the OR operator in terms of AND and NOT operator.
Аnswer:

(A . B)’ = +

( + )’ = A + B

Question 4:
Specify which axioms/theorems are being used in the following Boolean reductions :
(a) (be)’ + be = 1
(b) xyz + zx = xz
Аnswer:
(a) x + x’ = 1 & Complementary law
(b) y + x = x & Absorption law.

Question 5:
State and verify Associative law using Truth Table.
Аnswer:
Associative Law: This law states that:
(A + B) + C = A + (B + C)
(A.B).C = A. (B.C)
Proof:

∴ From above truth table,

(A + B) + C = A + (B + C)
Similarly, we can prove,
A. (B.C) = (A. B).C

Short Answer Type Questions-I [2 mark each]

Question 1:
Correct the following boolean statements :
1. X+1 = X
2. (A’)’ = A’
3. A+A’ = 0
4. (A+B)’ = A.B
Аnswer:
1. X+l=l or X+0=X
2. ((A’)’) = A
3. A + A’ = 1 or A. A’ = 0
4. (A 4- B)’ = A’.B1

Question 2:
Write the POS form of a Boolean Function F, which is represented in a truth table as follows :
Аnswer:
(P+Q+R).(P’+Q+R).(P’+Q’+R)

Short Answer Type Questions-II [3 mark each]

Laws and Theorems

Question 1:
State and Verify Absorption law algebraically.
Аnswer:
Absorption law states that :
A + AB = A and A. (A + B) = A
Algebraic method :
Taking LHS
A + AB = (A.l) + (A.B) by Identity
= A. (1 + B) by Distribution
= A.l by Null Element
=A

Question 2:
State and define principle of duality. Why is it so important in Boolean Algebra ?
Аnswer:
Principle of duality : Duality principle states that from every boolean relation another boolean relation can be derived by :
(i) Changing each OR sign (+) to an AND sign (-).
(ii) Changing each AND sign (-) to an OR sign (+)
ex : Dual of A + A’B = A. (A’ + B)
Importance in Boolean Algebra : The principle of duality is an important concept in Boolean algebra, particularly in proving
various theorems. The principle of duality is used extensively in proving Boolean algebra theorem. Once we prove that an
expression is valid, by the principle of duality, its dual is also valid. Hence, our effort in proving various theorems is reduced to
half.

Question 3:
Name the law shown below & verify it using a . truth table.

X+ .Y = X + Y.
Аnswer:
This law is called “Absorption Law” also referred as redundance law.

Question 4:
Draw a logic circuit for the following Boolean expression : ab + c.d’.
Аnswer:

Question 5:
Write the SOP form of a Boolean function F, which is represented in a truth table as follows :

Аnswer:
A’B’C + A’BC + AB’C + AB’C

Question 6:
Draw the Logic Circuit for the following Boolean Expression :
(U + V). w + z
Аnswer:

Question 7:
Verify the following using Boolean Laws :
LT + V = LTV + LP.V + U.V
Аnswer:
L.H.S.
= U’ + V
= U’ . (V + V) + V (LP + U)
= U’ . V + LP . V + U . V + U. V
= U’. V + LP. V + U. V
= R.H.S.

OR

R.H.S.
= U’V’ + U’. V + U. V
= LP . (V + V) + U. V
= U’ 1 + U.V
= U’ + U.V
= U’ +V
= L.H.S.

Question 8:
Draw the Logic Circuit for the following Boolean Expression :
(X’ + Y). Z + W’
Аnswer:

Question 9:
Write the equivalent boolean expression for the following logic circuit.

Аnswer:
((X’.Y)’ + (X.Y’)’)’

Question 10:
Write the equivalent Boolean Expression for the. following Logic Circuit :

Аnswer:
Z = (A+B)(B’ +C)
= A.B’ + AC + B.B’ + BC
= A.B’ + AC + BC

Question 11:
Obtain the Boolean Expression for the logic circuit shown below :

Аnswer:

F=

Question 12:
Name the law shown below & verify it using a truth table.
A + B . C = (A + B). (A + C).
Аnswer:
This law is called “Distributive Law”.
Prove by Truth table

Question 13:
Obtain the Boolean Expression for the logic circuit shown below :

Аnswer:

F = ( X. )+( + W).

F= +Y+ + W.

Question 14:
State Demorgan’s law. Verify one of them using truth table.
Аnswer:
There are two Demorgan’s law :

(i) = +

(ii) = .
Proof :

(i) = +

Question 15:
Draw a logic Circuit for the boolean expression:

A. + (C + ).
Аnswer:

Question 16:
Obtain the Boolean Expression for the logic circuit shown below :

F = P’ Q + (Q + R’)
= Q. (P’ + R’)

Question 17:
Verify the following using Boolean Laws X + Z = X + X’. Z + Y. Z
Аnswer:
Taking RHS
X + X’Z + YZ
= (X + X’). (X + Z) + YZ (Distribution Law)
= 1. (X + Z) + YZ (A + A’ = 1)
= X + Z + YZ
= X + Z (1 + Y)
= X + Z (1 + A = 1; 1. A = A)
= Hence verified

Question 18:
Verify the following using Boolean Laws : A + C = A + A. C + B.C
Аnswer:
A + C = A + A’.C + BC
Solve RHS
A + A’C + BC
(A + A). (A + C) + BC [Using distributive law]
1. (A + C) + BC
= A + C + BC
= A + C(1 + B)
= A + C.1
=A+C
= LHS (Hence, verified)

Question 19:
Obtain the Boolean Expression for the logic circuit shown below :
Expression at F :

( . Y) + (Y + )

( + 1) Y + [Distributive law]

Y+ [ ∴ 1 + Z = 1]

Question 20:
Verify the following using truth table :
(i) X . X’ = 0
(ii) X + 1 = 1
Аnswer:

Question 21:
Write the equivalent boolean expression for the following logic circuit :

Аnswer:

Y=U +

Question 22:
Write the equivalent boolean expression for the following logic circuit :

Аnswer:

Y = (U + ). (U + )
Question 23:
Verify the following using truth table :
(i) X + 0 = X
(ii) X + X’ = 1
Аnswer:

Question 24:
Derive a Canonical SOP expression for a Boolean function F, represented by the following truth table :

Аnswer:
F(A, B, C) = A’B’C + A’BC + AB’C + ABC
OR
F(A,B,C) =∑(0, 3,4,7)

Question 25:
Derive a Canonical POS expression for a Boolean function F, represented by the following truth table :
Аnswer:
F(RQ,R) = (P+Q+R’)(P+Q,+R)(P’+Q,+R’) (P’+Q’+R)
OR
F(RQ,R)=II(1,2,5,6)

Question 26:
Obtain a simplified form for a Boolean expression :
F(U, V, W, Z) = II (0,1,3,5, 6, 7,15)
Аnswer:

(u + v + w).(u+z’).(v’+w’).(u’+w’+z)

Question 27:
Reduce the following Boolean Expression to its simplest form using K-Map :
F (X, X Z, W) = X (0,1, 6, 8, 9,10,11,12,15)
Аnswer:
Simplified Expression : XY + Y’Z’ + XZ’W’ + XZW + X’YZW’

Question 28:
Reduce the following Boolean Expression to its simplest form using K-Map :
F(X, Y, Z, W) = X (0,1,4, 5,6, 7,8, 9,11,15)
Аnswer:
Simplified Expression : Y’Z’ + XY + XZW

Question 29:
Verify the following using Boolean Laws.
X + Y’ = X. Y + X. Y + X’. Y
Аnswer:
L. H. S.
= X + Y’
= X. (Y+Y’) + (X + X’). Y’
= X. Y + X. Y’ + X. Y’ + X’. Y’
= X. Y + X. Y’ + X’. Y’
= R. H. S
OR
= X. Y + X. Y’ + X’. Y’
= X. (Y + Y’) + X’. Y’
= X. 1 + X’. Y’
= X + X’. Y’
=X+Y
= L. H. S
Question 30:
State Distributive law and verify it using truth table.
Аnswer:
Distributive law : This law states that
(i) x(y + z) = xy + x.z.
(ii) x + yz = (x + y)(x + z)

Question 31:
Reduce the following Boolean Expression using KMap :
F(A, B, C, D) = ∑{0,1,3, 5, 6, 7,9,11,13,14,15}
Аnswer:
A’B’C’+D+BC

TOPIC-2
Karnaugh Map Minimization and Applications of Boolean Algebra
Very Short Answer Type Questions [1 mark each]

Question 1:
Write Product of Sum expression of the function F (a, b, c, d) from the given truth table

Аnswer:
F (a, b, c, d) =
(a + b + c + d).(a + b + c + d’). (a + b’ + c + d) . (a + b’ + c’ + d’). (a’ + b + c + d).
(a’ + b + c + d’). (a’ + b’ + c + d). (a’ + b’ + c + d’) . (a’ + b’ + c’ + d)

Question 2:
Convert the following boolean expression inti! its equivalent Canonical Sum of Products form (SOP) :
(U + V + W) (U + V + W’) (U’ + V + W) (U’ + V’ + W’)
Аnswer:
π (0,1, 4, 7)
∑(2, 3, 5, 6)
010 011 101 110
= U’VW’ + U’VW + UV’W + UVW’

Question 3:
Write the Sum of Product form of the function F(R Q, R) for the following truth table representation of F :

Question 4:
Write the Product of Sum form of the function F(X, Y, Z) for the following truth table representation of F :
Question 5:
Write the Product of Sum form of the function G(U, V W) for the following truth table representation of G :

Question 6:
Write the Product of Sum form of function G(U, V, W) for the following truth table representation of G :
Question 7:
Write the Sum of Product form of the function F(A, B, C) for the following truth table reprsentation of
SOP = A’BC’ + A’BC + AB’C’ + ABC

Question 8:
Write the SOP form of a boolean function F, which is represented in a truth table as follows:

Аnswer:
F(X, Y, Z) = X’.Y’. Z’ + X’. Y. Z’ + X. Y’. Z’+ X.Y.Z

Question 9:
Write the POS form of boolean function G, which is represented in a truth table as follows :
Аnswer:
G (A, B, C) = (A + B + C). (A + B’ + C’). (A’ + B + C). (A’ + B + C’)

Short Answer Type Questions-II

Question 1:
Obtain the minimal SOP form for the following Boolean expression using K-Map.
F(A,B,C,D) = ∑ (0,2,3,5,7,8,10,1143,15)
Аnswer:

Quad 1 = m0 + m2 + m8 + m10 = B’D’

Quad 2 = m3 + m7 + m15 + m11 = CD
Quad 3 = m5 + m7 + m15 + m13 = BD
Minimal SOP = B’D’ + CD + BD

Question 2:
Reduce the following Boolean expression using
K-Map :
F(A,B,C,D) = 7r (0,1,2,4,5,6,8,10)
Аnswer:

F(A, B, C, D) = π(0,1,2,4, 5, 6,8,10) F = (A + C).(A + D).(B + D)

Question 3:
Reduce the following using K-Map :
F (A, B,C,D) = ∑(1,3,4,5,6,7,12,13)
Аnswer:

Question 4:
Reduce the following boolean expression using
K-map.
F(EQ,R,S) = 2(0,2,4,5,6,7,8,10,13,15).
Аnswer:

Q+ + QS.

Question 5:
Reduce the following Boolean Expression using K-Map :
F(P, Q, R, S) = ∑(1,2, 3,4,5, 6, 7, 8,10)
Аnswer:

F(P, Q, R, S) = P’Q + P’S + P’R’S’ + PQ’S’

Question 6:
Reduce the following Boolean Expression using
K-Map :
F (A, B, C, D) = ∑(2, 3,4,5, 6, 7,8,10,11)

F (A, B, C, D) = A’B + A’C + B’C + ABD’

Long Answer Type Questions [4 marks each]

Question 1:
Verify the following using Boolean Laws :
[Delhi, 2016]
A ‘ + B’ . C=A’ . B ‘ . C ‘ + A’ . B . C ‘ + A’ .B.C + A’ .B’ .C+ A.B’ .C
Аnswer:
A’+ B’C = A’B’C’ + A,BCI + A’BC’ + A’BC + A’B’C + ABC
=A’C'(B’+B)+A’C (Grouping)
(B+B’)+AB’C
=> A’C’+ A’C + AB’C
(x+x’y=x+y)
=> A’ (C+C’ ) +AB’ C
=> A’+AB’C
(x+x’=1)
=> A’+B’C
X=A’ y=B’C
= LHS
Hence Proved.

Question 2:
Write the Boolean Expression for the result of the Logic Circuit as shown below :
Аnswer:
F = (u+v’).(u+w).(v+w’)

Question 3:
Derive a Canonical POS expression for a Boolen function F, represented by the following truth table :

Аnswer:
F = ∑(0, 3,4,5)
= (P + Q + R) (P + Q’ + R’) (P’ + Q + R) (P’ + Q + R’)

Question 4:
Reduce the following Boolean Expression to its simplest form using K-Map :
F (X, Y, Z, W)
∑(2,6,7,8,9,10,11,13,14,15)
Аnswer:
∑(2,6,7,8,9,10,11,13,14,15)

F = XY’ + ZW’+ XW + YZ

Question 5:
Write the Boolean Expression for the result of the Logic Circuit as shown below :
Аnswer:
G = PQ’ + PR + QR’

Question 6:
Derive a Canonical SOP expression for a Boolean function G, represented by the following truth table :

Аnswer:
G = ∑{(0,2,6,7)
= A’B’C’ + A’BC’ + ABC’ + ABC

Question 7:
Verify the following using Boolean Laws :
X’+ Y’Z = X’ .Y’ .Z’+X’ .Y.Z’+X’ .Y.Z+X’ .Y’ .Z + X.Y’.Z.
Аnswer:
X ‘+Y’ Z=X ‘ Y ‘ Z ‘ +X ‘ YZ ‘ +X ‘ YZ+X ‘ Y ‘ Z+XY ‘ Z
Taking RHS
Grouping terms
=> x’Z’ (Y’+Y)+X’ Z(Y+Y’)+XY’Z
=> X’Z’+X’Z+XY’Z
(Y+Y’=1)
=> X'(Z’+Z)+XY’Z
(Grouping)
=> X’+XY’Z (Z+Z’=l)
=> X’+Y’Z (Substitute X=X’ Y=Y’Z X+X’ Y = X+Y)
= LHS

Question 8:
Reduce the following Boolean Expression to its simplest form using K-Map :
F(P,Q,R,S) = ∑(0,4,5,8,9,10,11,12,13,15)
Аnswer:
F(P,Q,R,S) = ∑(0,4,5,8,9,10,11,12,13,15)
F = R’ S ‘ + PQ ‘ + QR’ + PS

Question 1:
Write the Sum of Product (SOP) form of the function F(P, Q, R)for the following truth table representation of F: Delhi 2014
Question 2:
Write the Product of Sum (POS) form of the function F(X, Y, Z)for the following truth table representation of F: All India 2014

Аnswer:
 –

Question 3:
Write the Product of Sum (POS) form of the function G (U,V,W) for the following truth table representation ofG: Delhi 2013
Question 4:
Write the Sum of Product (SOP) form of the function F(A, B, C) for the following truth table representation of F: All India 2013
Question 5:
Write the dual of the boolean expression

(A+0).(A.1. ).
Аnswer:
Using duality principle, changing (+) to (.) and vice-versa and by replacing 0’s with l’s and l’s with 0’s, the dual for the given
expression is as follows:

(A.1) + (A + 0 + )

Question 6:

Give the dual of the boolean function .(Y + Z) + .( + )

Аnswer:
Using duality principle, changing (+) to (.) and vice-versa and by keeping the form of variables as such the dual of the
expression is:

( + Y.Z) .( + . )

Question 7:
Seven inverters are cascaded one after another. What is the output, if the input is 1?
Аnswer:
The logic circuit is given:
 –

Question 8:
Represent F(a, b) = a.b using only NOT and OR gates.
Аnswer:
The expression F(a, b) = a.b using only NOT and OR gates is:

Question 9:

Find the complement of the following boolean function F1 = A.B + . ;

Аnswer:

Question 10:
State the distributive laws of boolean algebra. How do they differ from the distributive laws of ordinary algebra?
Аnswer:
Distributive laws of boolean algebra state that:

1. X.(Y + Z) = X.Y + X.Z

2. X + Y.Z = (X + Y).(X+Z)
Law X.(Y + Z) = X.Y + X.Z satisfies ordinary algebra for all values, whereas X + Y.Z = (X + Y).(X +‘Z) satisfies only for two
values (0, 1) of X, Y and Z.

Question 11:
How many input combinations can be there in the truth table of a logic system having (N) input binary variables?
Аnswer:
2N input combinations can be there in the truth table of a logic system.

Question 12:
Why are NAND and NOR gates called Universal gates?
Or
Which gates are called Universal gates and why?
Аnswer:
NAND and NOR gates are easier to design and basic functions like AND, OR and NOT, etc., can be easily implemented using
NAND/NOR gates. So, these gates are called Universal gates.

Question 13:

Draw a logic circuit diagram for the boolean expression A.(B + ). All India2008
Аnswer:
Logic circuit diagram for the boolean expression:

A.(B + )
Question 14:

Draw a logic circuit diagram for the boolean expression .(B + C).
Аnswer:

Logic circuit diagram for the boolean expression: .(B + C)

Question 15:

Express P + .R in canonical SOP form.

Аnswer:

Question 16:
Draw a logic circuit diagram for the following

boolean expression .( + Z) Delhi 2008

Аnswer:

A logic diagram for the boolean expression .( +Z)

Short Answer Type Questions [2 Marks]

Question 17:
Write the equivalent boolean expression for the following logic circuit:
Question 18:
Interpret the following logic circuit as boolean expression:

Question 19:
Verify the following using boolean laws:

A+C=A+ .C + B.C Delhi 2013

Аnswer:
A+C = A + .C + B.C

R.H.S =A + .C + B.C

=(A + ).(A + C)+B.C [By using Distributive law]

= 1. (A + C)+B.C [By using A+ =1]

= A+C+B.C = A+C.(1 + B)
= A + C.( 1 ) = A+C [∵ 1 + B = 1]
= L.H.S

Question 20:
Obtain the boolean expression for the logic circuit shown below:

Question 21:

Represent the boolean expression X. + Y. using only NAND gate.

Аnswer:

Question 22:

Represent the boolean expression (X + )Z with the help of NAND gate only.
Аnswer:

The boolean expression (X + ). Z can be implemented as:

Question 23:
Write the equivalent boolean expression for the following logic circuit:

Question 24:
Verify the following boolean expression using truth table:
(i) X.X = 0
(ii)X+ 1=1 All India 2012
Аnswer:
Question 25:
Name the law shown below and verify it using a truth table. Delhi 2014
A+B.C = (A+B).(A + C)
Аnswer:
A + B.C = (A + B).(A+C)
The above stated law is called distributive law.

Since, column five and column eight are identical, hence, the given law A + B.C = (A + B).(A + C) is verified.

Question 26:
Name the law shown below and verify it using a tru th table: All India 2014

X+ .Y = X+Y
Аnswer:
Name of the given law is redundant literal law.

Since, last two columns of the above tmth table are identical, hence, X+ . Y=X+Y is verified.

Question 27:
Draw the logic circuit for a half adder using NOR gate only.
Аnswer:
The boolean expression for the half adder,
Sum (S) = A. + .B
Carry (C) = A.B

Question 28:
Draw the logic circuit for a half adder using NAND gate only.
Аnswer:
The boolean expression for the half adder,

Sum (S) = A. + .B
Carry (C ) = A.B

Question 29:
State and prove DeMorgan’s laws in boolean algebra. Delhi 2011C, 2009C, 2008
Or
State DeMorgan’s laws. Verify one of the DeMorgan’s laws using a truth table. Delhi 2013C
Аnswer:
Refer to text on page no. 303-304.
Question 30:
Draw a logic circuit diagram for full adder. Give the truth table for full adder.
Аnswer:
Boolean function for full adder
Question 31:
Verify the following algebraically:

.Y + X. =( + ).(X + Y) All India 2010

Аnswer:

Question 32:
Given the following circuit:
Question 33:
Write the equivalent boolean expression for the following logic circuit: All India 2010

Question 34:

Verify .Y + X. + . = + using truth table.

Delhi 2009
Аnswer:
Question 35:
State and verify absorption law using truth table. All India 2009,2008
Аnswer:
Absorption Law It states that for boolean variables X and Y,
(i) X + X.Y = X
(ii) X.(X + Y) = X

Question 36:

Represent (P + R) in POS form. Delhi 2009C

To get the POS form, we need to product maxterms for all those input combinations that produce output as 0.

Thus, P + .R = (P +Q + R).(P + + R).(P + + )

Question 37:
Convert the following boolean expression into the equivalent canonical Product of Sum (POS) form

A. .C + .B.C + .B. All India 2008

Аnswer:

Question 38:
State and verify distributive law in boolean algebra. Delhi 2008C
Аnswer:
Distributive law state that:
(i) X.(Y + Z) = X.Y + X.Z
(ii) X + Y.Z = (X +Y).(X + Z)
Verification:
(i) Truth table of: X.(Y + Z) = X.Y + X.Z
Both columns identical. X.(Y + Z) and X.Y + X.Z are identical
∴ X.(Y + Z) = X.Y + X.Z
Hence Proved.
(ii)Truth table for X + Y.Z = (X + Y).(X + Z)

Both columns X + Y.Z and (X + Y).(X + Z) are identical.

X + Y.Z = (X + Y). (X + Z)
Hence Proved.

Question 39:
Convert the following boolean expression into its equivalent canonical Sum of Product (SOP) form. Delhi 2008C

( +v+ ).(u + + ).(u + v + w)

Аnswer:

Question 40:
State and verify associative law.
Аnswer:
The associative law states:
(i) X + (Y + Z) = (X + Y) + Z
(ii) X.(Y.Z) = (X.Y).Z
Verification:
(i) Truth table of X+ {Y + Z) = (X+ Y) +Z

Both columns X + (Y + Z) and (X + Y) + Z are identical.

∴ X +(Y + Z) = (X + Y) + Z Hence Proved.
(ii) Truth table of X.(Y.Z) = (X.Y).Z

Both columns X.(Y.Z) and (X.Y).Z are identical.

X .(Y .Z) = (X ,Y).Z Hence Proved.

Question 41:
Given the following truth table, derive a Sum of Product (SOP) and Product of Sum (POS) form of boolean expression from it:
Question 42:
Question 43:
Question 44:
Design a circuit (3 inputs) which gives a high output only when there is even number of low or high inputs.
Аnswer:
High output when even number of low inputs or even number of high inputs, i.e.
Question 45:
A boolean function F defined on three input variables X, Y and Z is, if and only if number of 1 input is odd. Draw the truth table
for the above function and express it in canonical SOP form.
Аnswer:
Truth table
 Topic – 2
Karnaugh Map (K-Map)
Exam Practice
Short Answer Type Questions [3 Mark]

Question 1:
Obtain the minimal form for the following boolean expression using Karnaugh’s map: All India 2014
F(A, B, C, D) = ∑(1,3, 4,5,6,7,12,13)
Аnswer:
F (A, B,C, D) = ∑(1,3, 4,5,6,7,12,13)

Question 2:
Obtain the minimal form for the following boolean expression using Karnaugh’s map:
H (P, Q, R, S)=∑(0, 1,2, 3, 5, 7, 8, 9, 10, 14, 15) Delhi 2013
Аnswer:
Question 3:
What is the simplified boolean expression for the following K-map:

Question 4:
Simplify the expression:
Question 5:
Reduce the following boolean expression using K-map: F (A, B, C,D) = ∑(2,3, 4,5,6,7,8,10,11 ) All India 2012
Аnswer:
F (A, B,C, D) = ∑(2,3,4,5,6,7,8,10,11)
Question 6:
Reduce the following boolean expression using K-map: F(U, V, W, Z) = ∑(0, 1, 2, 4, 5, 6, 8, 10)
Аnswer:
F(U,V,W,Z) = ∑(0,1,2,4,5,6,8,10)

Question 7:
Reduce the following boolean expression using K-map:
F(A,B, C, D) = ∑(3, 4,5,6,7,13,15) All India 2010
Аnswer:
F (A, B,C,D) = ∑(3,4,5,6,7,13,15)

Question 8:
Reduce the following boolean expression using K-map:
F(A,B,C,D) = ∑(0,1,2,3,4,5,10,11,15)
Аnswer:

Question 9:
Reduce the following boolean expression using K-map :
F(P, Q, R, S) = ∑(1,2,3,5,6,7,9,11,12,13,15) Delhi 2009
Аnswer:
F (P,Q, R,S) = ∑(1,2,3, 5,6,7,9,11,12,13,15)
Question 10:
Simplify using Karnaugh’s map for:

Question 11:
In the K-map shown below, which of the groupings shown in the K-map represents legal grouping?

Аnswer:
Groups must contain 2,4, 8 or in general 2n cells either in horizontally or vertically. So, grouping A and E are legal groupings.
Question 12:
Draw the K-map and give the reduced SOP expression for the following truth table: