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

Full Subtractor from Half Subtractors

MediumLogic CircuitBuild

Arithmetic Logic Units (ALUs) rely on hierarchical modularity to scale up complex operations. Multi-bit subtractors cascade single-bit stages to compute differences and propagate borrows across wide data paths.

The circuit must compute A minus B minus Bin. It must produce a difference bit D and a borrow-out bit Bout.

| A | B | Bin | D | Bout | |-----|-----|-------|-----|--------| | 0 | 0 | 0 | 0 | 0 | | 0 | 0 | 1 | 1 | 1 | | 0 | 1 | 0 | 1 | 1 | | 0 | 1 | 1 | 0 | 1 | | 1 | 0 | 0 | 1 | 0 | | 1 | 0 | 1 | 0 | 0 | | 1 | 1 | 0 | 0 | 0 | | 1 | 1 | 1 | 1 | 1 |

Constraints

  • Build the circuit using exactly two Half Subtractor blocks and exactly one OR gate.
  • Do not use discrete XOR, AND, or NOT gates to compute the core logic.
  • Implement strictly as a combinational circuit with no sequential elements.

Topics

combinationalarithmeticmodular-design

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