Professional Documents
Culture Documents
Key point
The first two problems at S. Nos. 1 and 2 are on the Number of Boolean expressions for
a given number of variables.
The number of Boolean expressions for n variables is
Note that for n variable Boolean function one can have 2n Boolean inputs.
1. The number of Boolean function that can be generated by n variables is equal to:
(c)
(a)
(d)
(b)
[GATE 1990 : 1 Mark]
Ans. (b)
The number of district Boolean expressions for n variables is
Where, n is the number of variables.
3. Two 2s complement number having sign bits x and y are added and the sign bit of
the result is z. Then, the occurrence of overflow is indicated by the Boolean function.
(a)
(c)
(b)
(d)
[GATE 1998 : 1 Mark]
Ans. (c)
This problem is based on 2s complement addition/subtraction (covered in
number systems). Here we have to write the Boolean expression for the case
where overflow occurs.
In the 2s complement arithmetic we had seen that if MSB (Sign bit) of operands
(Minuend & Subtrahend) is same, and the MSB of the result is different or vice
versa an overflow occurs.
i.e.
or, if
Overflow occurs
So, we can write
Key points:
The problems in Q Nos. 3, 4, 5, 6, 7 and 8 are on the simplification of Boolean
expressions based on algebraic methods like using laws and theorems of Boolean
algebra. But this method becomes complex with increase in number of variables and
number of terms.
(b)
is equivalent to
(c)
(d)
)(
(
(
)
(
(a)
(c)
(b)
(d)
) is
)(
)(
(a)
(b)
is equivalent to
(c)
(d)
B
0
0
1
1
0
0
1
1
(
(
C
0
1
0
1
0
1
0
1
F
0
0
0
1
0
0
1
0
)(
)(
)
)
(c) (
(d) (
)(
)(
)
)
)
)(
Since
So,
( )(
)
(
)
(b)
)+
then
(c)
(d)
[GATE 2009 : 2 Marks]
Ans. (d)
Given logic equation is
*
)+- *
)+
)+
+
Key Points:
9. The K-map for a Boolean function is shown in figure. The number of essential prime
implicants for this function is
AB
00
01
11
10
00
01
11
10
CD
(a) 4
(b) 5
(c) 6
(d) 8
[GATE 1998 : 1 Mark]
Ans. (a)
AB
CD
00
00
01
11
01
10
1
1
11
10
10. The number of products terms in the minimized sum-of-product expression obtained
through the following K-map is (where, d denotes dont care states)
(a) 2
(b) 3
(c) 4
(d) 5
[GATE 2006 : 2 Marks]
Ans. (a)
AB
CD
00 01 11 10
00
01
11
10
(b)
(c)
(d)
can be minimized to
CD
AB
00
01
10
11
00
01
11
10
Alternative method
(a)
(b)
(c)
(d)
[GATE 2012 : 2 Marks]
Ans. (a)
YZ
00
01
11
10
0
1
(
1
)