Question 1 |
Consider a Boolean function f(w,x,y,z) such that
\begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array}
The number of literals in the minimal sum-of-products expression of f is ________
\begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array}
The number of literals in the minimal sum-of-products expression of f is ________
4 | |
6 | |
8 | |
9 |
Question 1 Explanation:
Question 2 |
Consider the following Boolean expression.
F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)
Which of the following Boolean expressions is/are equivalent to \overline F (complement of F)?
[MSQ]
F=(X+Y+Z)(\overline X +Y)(\overline Y +Z)
Which of the following Boolean expressions is/are equivalent to \overline F (complement of F)?
[MSQ]
(\overline X +\overline Y +\overline Z)(X+\overline Y)(Y+\overline Z) | |
X\overline Y + \overline Z | |
(X+\overline Z)(\overline Y +\overline Z) | |
X\overline Y +Y\overline Z + \bar X \bar Y \bar Z |
Question 2 Explanation:
Question 3 |
The following circuit compares two 2-bit binary numbers, X and Y represented by X_{1}X_{0} and Y_{1}Y_{0} respectively. (X_{0} and Y_{0} represent Least Significant Bits)

Under what conditions Z will be 1?

Under what conditions Z will be 1?
X > Y | |
X < Y | |
X=Y | |
X!=Y |
Question 3 Explanation:
Question 4 |
If ABCD is a 4-bit binary number, then what is the code generated by the following circuit?


BCD code | |
Gray code | |
8421 code | |
Excess-3 code |
Question 4 Explanation:
Question 5 |
Minimum number of NAND gates required to implement the following binary equationY=(\bar{A}+\bar{B})(C+D)
4 | |
5 | |
3 | |
6 |
Question 5 Explanation:
Question 6 |
Consider the Boolean function z(a,b,c).

Which one of the following minterm lists represents the circuit given above?

Which one of the following minterm lists represents the circuit given above?
z=\Sigma (0,1,3,7) | |
z=\Sigma (1,4,5,6,7) | |
z=\Sigma (2,4,5,6,7) | |
z=\Sigma (2,3,5) |
Question 6 Explanation:
Question 7 |
What is the minimum number of 2-input NOR gates required to implement 4-variable function expressed in sum-of-minterms from as f = \Sigma (0, 2, 5, 7, 8, 10, 13, 15)? Assume that all the inputs and their complements are available. Answer ________ .
2 | |
3 | |
4 | |
5 |
Question 7 Explanation:
Question 8 |
Consider three 4-variable functions f_1,f_2 \; and \; f_3, which are expressed in sum-of-minterms
f_1=\Sigma (0,2,5,8,14)
f_2=\Sigma (2,3,6,8,14,15)
f_3=\Sigma (2,7,11,14)
For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:

f_1=\Sigma (0,2,5,8,14)
f_2=\Sigma (2,3,6,8,14,15)
f_3=\Sigma (2,7,11,14)
For the following circuit with one AND gate and one XOR gate, the output function f can be expressed as:

\Sigma (7,8,11) | |
\Sigma (2,7,8,11,14) | |
\Sigma (2,14) | |
\Sigma (0,2,3,5,6,7,8,11,14,15) |
Question 8 Explanation:
Question 9 |
Which one of the following is NOT a valid identity?
(x\oplus y)\oplus z=x\oplus (y\oplus z) | |
(x+ y)\oplus z=x\oplus (y+z) | |
x\oplus y=x+y, \; if \; xy=0 | |
x\oplus y=(xy+x'y')' |
Question 9 Explanation:
Question 10 |
Any set of Boolean operation that is sufficient to represent all Boolean expression is said to be complete. Which of the following is not complete ?
{AND, OR} | |
{AND, NOT} | |
{NOT, OR} | |
{NOR} |
Question 10 Explanation:
There are 10 questions to complete.
IN Q37 THERE IS AN ERROR IN QUESTION STATEMENT …
Thank You Akki Yadav,
We have updated the question.
Q62 OPTION (A) IS CORRECT PLS CORRECT IT ….
Thank You Akki Yadav,
We have updated the answer.
question no 83 ,
option and answer is wrong
Thank You Shivam,
We have updated the option.
q-2
opt (d) xyz whole bar is not correct. its x bar, y bar, z bar
Thank You Ramananda Samantaray,
We have updated the option.
Check solution of question number 104 correct option is displayed wrong please rectify it. 👍
Thank You PRAFUL SAMBHAJI RANE,
We have updated the answer.
Please rectify the mistake in question number 58 of Boolean algebra correct answer is X
Thank You PRAFUL SAMBHAJI RANE,
We have updated the answer.