Boolean-Function

Question 1
 Consider the following Boolean expression.
A
B
C
D
Question 1 Explanation: 

XY’+Z’ is a minimal SoP expression which represents the function (X,Y,Z).

The expression XY’ + YZ’ + X’Y’Z’ can be reduced to XY’+Z’

XY’ + YZ’ + X’Y’Z

= Y’(X+X’Z’) + YZ

= Y’(X+Z’) + Y

= XY’ + Y’Z’ + YZ’

= XY’ + (Y’+Y)Z’

= XY’ + Z’.

The expression (X+Z’)(Y’+Z’) is a PoS expression which also represents the same function (X,Y,Z).

Question 2
Consider a Boolean function f(w, x, y, z) such that
               f(w, 0, 0, z) = 1
               f(1, x, 1, z) = x + z
               f(w, 1, y, z) = wz + y
The number of literals in the minimal sum-of-products expression of f is __________.
A
6
Question 2 Explanation: 

f(w,0,0,z)= 1 If x=y=0, then the sum of the corresponding minterms be 1. 

The minterms with literals x’ and y’ are wx’y’z(9), w’x’y’z(1), wx’y’z’(8), w’x’y’z’(0) . 

If x=y=0, then we get wz+w’z+wz’+w’z’ = 1. 

f(1,x,1,z)= x+z. 

The minterms with variables w and y in true form and x or z or both in true form. 

The corresponding minterms are wx’yz(11), wxyz’(14), wxyz(15) 

If w=1 and y=1, then we get x’z+xz’+xz= x+z. 

f(w,1,y,z)= wz+y

The corresponding minterms are w’xyz’(6), w’xyz(7), wxyz’(14), wxyz(15), wxy’z(13).

If x=1, then we get w’yz’ + w’yz+ wyz’ + wyz+ wy’z = y + wz

So, the function f(w,x,y,z)= Σ(0,1,6,7, 8,9, 11, 13, 14, 15,).

Therefore, the k-map will be:

Therefore, the minimal expression will be: X’Y’ + WZ + XY 

Thus, the number of literals will be 6.

Question 3
A switching function can also be written as
A
Σ(1, 3, 5, 7, 9)
B
Σ(3, 5, 7, 9, 11)
C
Σ(3, 5, 9, 11, 13)
D
Σ(5, 7, 9,11,13)
Question 3 Explanation: 
Question 4
How many distinct Boolean functions can be formed from ‘n’ Boolean variables?
A
n2
B
2n2
C
2n
D
2 to the power of 2n
Question 4 Explanation: 
Each “boolean” variable has two possible values i.e 0 and 1.
Number of variables= n
Number of input combinations is 2n.
Each “boolean” function has two possible outputs i.e 0 and 1.
Number of boolean functions possible is 22^n.
Formula: The number of m-ary functions possible with n k-ary variables is mk^n.
Question 5
What is the maximum number of different Boolean functions involving n Boolean variables?
A
n^2^n
B
2^n
C
2^2^n
D
n^2
Question 5 Explanation: 
No. of rows possible with n boolean variables is 2^n, and each row can have two functions possible . Hence the total number of boolean functions possible is 2^(2^n).
Question 6
A
x.y’
B
x.y’+z
C
x.z’
D
none of the options
Question 6 Explanation: 
Question 7
Given the truth table of a Binary Operation $ as follows:

Identify the matching Boolean Expression.
A
X $ Y'
B
X' $ Y
C
X' $ Y'
D
None of the above
Question 7 Explanation: 
X$Y= X+Y'
So,
X $ ¬Y= X+Y
¬X $ Y= X' + Y'
¬X $ ¬Y= X' + Y
There are 7 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

Register Now

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access