# Questions & Answers of Boolean algebra

Question No. 253

Following is the K-map of a Boolean function of five variables P, Q, R, S and X. The minimum sum-of-product (SOP) expression for the function is

Question No. 46

The Boolean expression $\mathrm{F}\left(\mathrm{X},\mathrm{Y},\mathrm{Z}\right)=\overline{\mathrm{X}}\mathrm{Y}\overline{\mathrm{Z}}+\mathrm{X}\overline{\mathrm{Y}}\overline{\mathrm{Z}}+\mathrm{XY}\overline{\mathrm{Z}}+\mathrm{XYZ}$. converted into the canonical product of sum (POS) form is

Question No. 146

A function of Boolean variables X, Y and Z is expressed in terms of the min-terms as

F(X,Y,Z) = $\sum$(1, 2, 5, 6, 7)

Which one of the product of sums given below is equal to the function F(X, Y, Z)?

Question No. 25

The Boolean expression $\left(\mathrm{X}+\mathrm{Y}\right)\left(\mathrm{X}+\overline{)\mathrm{Y}}\right)+\overline{\left(\mathrm{X}\overline{\mathrm{Y}}\right)+\overline{\mathrm{X}}}$ simplifies to

Question No. 51

Consider the Boolean function, Which one of the following is the complete set of essential prime implicants?

Question No. 124

For an n-variable Boolean function, the maximum number of prime implicants is

Question No. 42

In the circuit shown below, Q1 has negligible collector-to-emitter saturation voltage and the diode drops negligible voltage across it under forward bias. If Vcc is +5 V, X and Y are digital signals with 0 V as logic 0 and Vcc as logic 1, then the Boolean expression for Z is

Question No. 19

In the sum of products function f(X,Y,Z)=$\sum \left(2,3,4,5\right)$,the prime implicants are

Question No. 36

If X = 1 in the logic equation $\left[X+Z\left\{\overline{Y}+\left(\overline{Z}+X\overline{Y}\right)\right\}\right]\left\{\overline{X}+\overline{Z}\left(X+Y\right)\right\}=1$, then

The Boolean expression $Y=\overline{A}\overline{B}\overline{C}D+\overline{A}BC\overline{D}+A\overline{B}\overline{C}D+AB\overline{C}\overline{D}$ can be minimized to