0/34
0
0
Save Progress
Show Timer
Qn #2045
00:00
Qn #2036
The minimum number of gates needed to implement the Boolean function
f(x, y, z) = z(x + y) + (z̅ + x + y)(x̅ + y̅) is
Qn #1911
Qn #1785
Which of the following Boolean expression represents the shaded portion of the Venn diagram?
Note: Here "." represents an AND operation and "+" denotes an OR operation.
Qn #1779
Qn #1778
Consider x and y be some Boolean variables, + denotes the OR operation and "." denotes the AND operation. What will be the simplified form of the Boolean expression: x.(x + y)?
Qn #1689
Qn #1686
Qn #1492
Qn #1366
Qn #1362
Consider the following min term expression for F.
F(P,Q,R,S) = ∑ (0, 2, 5, 7, 8, 10, 13, 15)
The minterms 2, 7, 8 and 13 are ‘do not care' terms.
The minimal sum of products form for F is
Qn #1233
Qn #1232
Qn #1226
Qn #1224
Qn #1096
Qn #1089
Qn #1036
If we can generate a maximum of 4 Boolean functions using n Boolean variables, what will be minimum value of n?
Qn #971
Qn #963
Qn #733
Qn #727
Let $\oplus$ and $\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?
Qn #726
Qn #722
Cosider the following Boolean Expression for F:
$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .
The minimum sum of products form of F is
Qn #717
Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is
Qn #618
The
Boolean expression for the following truth table is _________
| x | y | z | f |
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Qn #604
Qn #596
Qn #422
Given the Boolean expression $ (A \oplus B) \land (B \to C), $ which of the
following rows in the truth table would have an output of $1$ (True)?
Qn #412
Consider the Boolean function in a CPU control unit:
\[
Y = (A + B\cdot \overline{C}) \cdot (\overline{A}\cdot B + C)
\]
Qn #408
Consider the Boolean expression $ X = \overline{(A + B) \cdot C}$ over two Boolean variables $A$
and $B$. Which one of the following Boolean expressions is equivalent to the given Boolean
expression $X$?
Qn #266
With regard to NAND gate, which of the following statements are true: 1. It is equivalent to an AND gate followed by an inverter 2. If all the inputs are low, the output is low 3. If all the inputs are high, the output is low 4. NAND on two operations is equivalent to OR operation. Of these, the correct statements are:
Qn #179
Qn #79