Implement the miltiiplexer

here you have to use 16:1 multiplexer.

f(A,B,C,D) = ∑(0,1,3,4,8,9,15)
for this function make the state 0,1,3,4,8,9,15 to the main supply and the remaining state i.e 2,5,6,7,10,11,12,13,14 to ground(it is absent).
Here there are four input so you have to use 16:1 multiplexer.
!6:1 means that there are 16 inputs(0 to 15) and 1 output.
So for your given function only state 0,1,3,4,8,9 and 15 are present and rest of the state are absent.

feel free to ask any question related to this...

sushant005here you have to use 16:1 multiplexer.

f(A,B,C,D) = ∑(0,1,3,4,8,9,15)
for this function make the state 0,1,3,4,8,9,15 to the main supply and the remaining state i.e 2,5,6,7,10,11,12,13,14 to ground(it is absent).
Here there are four input so you have to use 16:1 multiplexer.
!6:1 means that there are 16 inputs(0 to 15) and 1 output.
So for your given function only state 0,1,3,4,8,9 and 15 are present and rest of the state are absent.

feel free to ask any question related to this...

Thanks for the solution, i was also thinking like that only. But if you can access then have a look on GATE 2008 Computer Science by G.K.Publishers, they have given some weird solution involving A, A' only and making 8 input lines and 3 selection lines etc. I am not able to understand that method.

Nice solution with explanation sushant 😀