List of top Computer Awareness Questions on Binary logic asked in NIMCET

Simplify the Boolean expression: \[ (x+y'+z')(x+y'+z)(x+y+z') \]
Which of the following is the CORRECT truth table for the XOR gate with two binary inputs A and B?
Given the Boolean expression \( (A \oplus B) \land (B \rightarrow C) \), which of the following rows in the truth table would have an output of 1 (True)?
Consider the Boolean expression \( X = (A + B). C \) over two Boolean variables A and B. Which one of the following Boolean expressions is equivalent to the given Boolean expression X?
Consider the Boolean function in a CPU control unit: \[ Y = (A + B . C') . (A . B + C) \] Which of the following is the correct simplified expression for \( Y \)?
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:

Consider the circuit shown below and find the minimum number of NAND gates required to design it. 

Consider the following minterm expression for \( F \): \[ F(P, Q, R, S) = \Sigma(0, 2, 5, 7, 8, 10, 13, 15) \] \(\text{The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is}\)

The number of minterms in an \( n \) variable truth table is:
The reduced form of the Boolean function \( F = xyz + xyz' + x'yz + zy'z \) is

Consider the following Boolean expression for F: \( F(P, Q, R, S) = PQ + PQR + \overline{P}QR \). The minimum sum of products form of F is
 

Let \( \oplus \) and \( \odot \) denote the Exclusive-OR and Exclusive-NOR operations respectively. Which one of the following is not correct?
The number of minterms in an n-variable truth table is:
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.
Consider the circuit shown below and find the minimum number of NAND gates required to design it.

Write the simplified form of the Boolean expression \( (A + C)(AD + AD') + AC + C \):

The Boolean expression \( AB+ A\bar{B} + \bar{A}C + AC \) is unaffected by the value of the Boolean variable
If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):
The minimum number of NAND gates required for implementing the Boolean expression, \( AB + ABC + AB\bar{C} \) is:
Which of the following is equivalent to the Boolean expression: \( (X+Y)(\bar{X}+Y)(X+\bar{Y}) \)?