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

Build a 4:1 MUX from Three 2:1 MUXes

EasyLogic CircuitBuild

Large routing networks in processors and memory controllers rely on hierarchical selection structures rather than flat gate-level designs. Cascading smaller multiplexers into trees creates scalable data paths with uniform propagation delays.

Construct a 4:1 multiplexer that routes one of four data inputs (I0, I1, I2, I3) to the output Y based on a 2-bit select signal (S1, S0). The signal S1 serves as the most significant bit of the selector.

| S1 | S0 | Y | |------|------|-----| | 0 | 0 | I0| | 0 | 1 | I1| | 1 | 0 | I2| | 1 | 1 | I3|

Constraints

  • Construct the circuit using exactly three 2:1 multiplexers.
  • Do not use any basic logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR).
  • Route the select lines so that all combinations correctly map the inputs to the output.

Topics

Combinational LogicMultiplexersHierarchy

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