June 29, 2012

Puzzle: Multiplexer Trees

Are you comfortable making multiplexer trees? If you are, then try this one:

How many 2:1 MUXes you would require to make any n:1 MUX, where n is any integer greater than or equal to 2.

Answer is n-1.


By principle of mathematical induction, we can say that for any n:1 MUX, we would require (n-1) 2:1 MUXes.

No comments:

Post a Comment