Boolean Algebra Questions With Solutions
Boolean Algebra Questions With Solutions
Answer:
The result of a Boolean expression is always a Boolean value. A Boolean expression is made up
of the Boolean constants, logical connectives and Boolean variables and logical connectives. A
Boolean function is represented by each Boolean expression. The Boolean expression XY′Z is an
example.
Answer:
Isomorphic Boolean algebras B and B1 are those that have a one-to-one correspondence f: B
⟶B1 that retains the three operations +,*, and ‘ for all elements x, y in B,
f (x+y)=f(x)+f(y)
f (x*y)=f(x)*f(y) and
f(x’)=f(x)’
Answer:
A Boolean function is a type of mathematical function with the formula f:Xn→X of degree n,
where ‘n’ is a non-negative integer, and X = {0,1} is a Boolean domain. It explains how Boolean
input generates Boolean output.
Let F(X, Y)=X′Y′ as an example. This is a degree 2 function from the collection of ordered pairs
(two numbers) of Boolean variables to set 0,1 with F(0, 1)=0, F(0,0) = 1, F(1,1)=0, and F(1,0) =
0.
Boolean Identities
Solution:
⇒ F(X, Y, Z) = X′Y+(YZ′+YZ)+(YZ′+XY′Z′)
⇒ F(X, Y, Z) = X′Y+Y(Z′+Z)+Z′(Y+XY′)
⇒ F(X, Y, Z) = X′Y+Y.1+Z′(Y+X)
⇒ F(X, Y, Z) = Y(X′+1)+Z′(Y+X)
⇒ F(X, Y, Z) = Y+YZ’+XZ’
⇒ F(X, Y, Z) = Y(1+Z′)+XZ′
Hence, the simplified form of the given Boolean expression is F(X, Y, Z) = Y+XZ′.
Solution:
Therefore, using dominance law, we can get the reduced form as follows:
⇒ F(P, Q, R) = 1.P+Q.R
⇒ F(P, Q, R) = P+Q.R
6. What is the equivalent expression for the Boolean expression x’y’z +yz+ xz?
Solution:
Answer: z
Now, apply distributive law for the first two terms inside the bracket.
Further x+x’ = 1
7. What is the simplified sum of product form for the Boolean expression:
Solution:
Since A + 0 = A,
8. Write the reduced form for the Boolean expression (AB’(C+BD) + A’B’)C.
Solution:
Since, BB’ = 0
Solution:
A = XY + XY + XZ + YY + YZ
Thus, A = XY + XY + XZ + Y + YZ
A = XY + XZ + Y + YZ
A = XY + XZ + Y(1+Z)
A = XY + XZ + Y.1
A = Y(1+X) + XZ
A = Y.1 + XZ
A = Y + XZ
Hence, the reduced form of the Boolean expression A = XY + X(Y+Z) + Y(Y+Z) is A = Y+XZ.
Solution:
AC (1+B) = AC
Now, using the null law 1+B = 1, the above expression can be written as:
AC.1 = AC
Thus, using the identity law, 1.A = A, the above expression becomes:
AC = AC