CodiodeCodiode
Home
Problem Solving
Skill Tracks
My Assignments
Contests
Leaderboard
Community
Settings
Codiode/Problems/Combinational Logic

De Morgan's Theorem: Single-Variable NAND

EasyLogic CircuitAnalyze

CMOS fabrication produces NAND and NOR gates natively as the foundational building blocks of all modern processors.

The expression Y = (AB)' represents a two-input NAND gate driven by inputs A and B.

Apply De Morgan's Theorem to convert this expression into its OR-based equivalent. Verify the functional equivalence by evaluating the truth table for all four input combinations of A and B. Identify the reverse transformation from a sum of inverted inputs back to a native CMOS gate.

Constraints

  • Assume standard two-level logic optimization.
  • Inputs A and B are standard binary signals driven to either 0 or 1.

Topics

logic-gatesboolean-algebracmosdemorgans-theorem

Solve this problem

Place the gates, wire them up and watch the signals settle. Every submission runs on the same simulation engine that grades it.

This problem is part of Codiode Pro. The statement above is free to read.

Sign in to solveSee what Pro unlocks

The circuit builder and code editor need a desktop screen. On a phone, read the problem here and open it on a laptop to solve.

Related problems

  • Binary to HexEasy
  • 1-to-4 Demultiplexer from AND and NOT GatesEasy
  • 2-to-4 Line Decoder with Active-High EnableEasy
  • Hex Nibble to BinaryEasy
  • Odd Parity Bit Generator for 3-bit DataEasy
  • Full Adder from Half AddersEasy
  • Modulo ArithmeticMedium
  • Two's Complement: Encode a Negative DecimalEasy

Browse all problems · Learning tracks