0/35
0
0
Save Progress
Show Timer
Qn #2049
00:00
Qn #1916
A switching circuit that produces one in a set of input bits as an output based on the control value of control bits is termed as:
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 #1226
Qn #1224
Qn #1096
Qn #1089
Qn #972
Qn #971
Qn #969
Consider the following circuit.
How many minimum numbers of two input NAND
gates are required to design the above circuit?
Qn #963
Qn #733
Qn #730
Consider the circuit shown below and find minimum number of NAND gates required to design it.
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 #720
A bulb in the staircase has two switches, one switch is at the ground floor and the other one is at the first floor. The bulb can be turned ON and also can be turned OFF by any of the switches irrespective of the state of the other switch. The logic of the switching of the bulb resembles
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 #409
Which of the following is the CORRECT truth table for the XOR Gate with two binary inputs A and
B?
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 #272
______ is a combinatorial circuit that converts binary information from n input lines to a maximum of 2^n output lines.
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 #196
Qn #182
Qn #180
Qn #179
Qn #83
Qn #82
Qn #80