# The output of a logic gate is ‘1’ when all its inputs are at logic ‘0’. The gate is either

1.  NAND or EX-OR gate

2.  NOR or EX-NOR gate

3.  OR or EX-NOR gate

4.  And or EX-OR gate

4

NOR or EX-NOR gate

Explanation :
No Explanation available for this question

# The gate shown in the figure is

1.  AND gate

2.  NAND gate

3.  NOT gate

4.  OR gate

4

NOT gate

Explanation :
No Explanation available for this question

# When signed numbers are used in binary arithmetic, then which of the following notations would have unique representation for zero

1.  Sign-magnitude

2.  1’s complement

3.  2’s complement

4.  9’s complement

4

2’s complement

Explanation :
No Explanation available for this question

# The logic circuit given below converts a binary code Y1 Y2 Y3 into

1.  Excess-3 code

2.   Gray code

3.  BCD code

4.  Hamming code

4

Gray code

Explanation :
No Explanation available for this question

# The minimum Boolean expression for the given circuit is

1.  AB +AC + BC

2.  A +BC

3.  A + B

4.  A + B + C

4

AB +AC + BC

Explanation :
No Explanation available for this question

# In the circuit shown below, the value of RL such that the power transferred to RL maximum is

1.   5 Ω

2.  10 Ω

3.  15 Ω

4.   20 Ω

4

15 Ω

Explanation :
No Explanation available for this question

# Venn diagram representing the Boolean expression A+ ( .B) is

1.

2.

3.

3

Explanation :
No Explanation available for this question

# Complement of the Boolean expression AB.(C + AC) is

1.

2.

3.

4.

4

Explanation :
No Explanation available for this question

# In the circuit shown below, the Norton equivalent current in amperes with respect to the terminals P and Q is

1.   6.4-j 4.8

2.   6.56-j 7.87

3.  10 + j 0

4.  16 + j 0

4

6.4-j 4.8

Explanation :
No Explanation available for this question

1.

2.

3.

3