Question 88

Computer Awareness Boolean algebra Easy

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

Question Image
(A) 4
(B) 6
(C) 3
(D) 5
โœ“ Correct Answer: Option A Verified Solution

๐Ÿ“˜ Step-by-Step Solution & Detailed Explanation:

The circuit in the figure is a single 2-input NOR gate: \(Y = \overline{A + B}\).

Building it with NAND gates only:

  1. NAND 1: \(\overline{A \cdot A} = \bar{A}\)
  2. NAND 2: \(\overline{B \cdot B} = \bar{B}\)
  3. NAND 3: \(\overline{\bar{A} \cdot \bar{B}} = A + B\) (De Morgan's law)
  4. NAND 4: invert it to get \(\overline{A + B}\)

Minimum = 4 NAND gates.

Answer: (A) 4

Practice Similar Boolean algebra Questions

Reinforce your conceptual grasp with related questions from NIMCET 2023:

Q75 Consider the following minterm for F: \( ฯ€(P, Q, R, S) = (0, 2, 5, 7, 8,...
Solve โ†’
Q84 The number of minterms in a \(n\) variable truth table is
Solve โ†’
Q85 Let \( \) and \( \) denote the Exclusive - OR and Exclusive-NOR operations...
Solve โ†’
Q91 The reduced form of the Boolean function xyz + xyz' + x'yz + xy'z
Solve โ†’
Q72 The maximum and minimum value represented in signed 16-bit 2s compliment...
Solve โ†’
Full-Length Test Series

Prepare for NIMCET Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series โ†’