i need to implement a function using a 4:1 mux

i added the function,my solution to it and the right solution
in the link bellow

i cant understand where is my error???????????

http://img293.imageshack.us/my.php?image=13985609hu3.gif

 

Your problem doesn't make sense. You simply didn't get the right answer because you interpreted it differently. In the actual solution only four cases output a zero:
[0001],[0011],[1001],[1011].

 

ye i understand that we should take the minimal function from the karno table

i cant understand how did they build this mux using that function???

 

also there is another question which solves this kind of question
in "wronge way" and he got full points

http://img166.imageshack.us/my.php?image=img8810ev2.jpg

whyyy????????

 

The mux gives the equation:
Y = !C*!D + B*C*D + !C*D*D + C*!D*D
The last term is always 0 because !D*D
The next to last term can drop the second D.
Then rearranging:
Y = !C*!D + !C*D + B*C*D
The first two terms can be combined.
Y = !C(!D + D) + B*C*D
The !D + D is always 1 so it can go away.
Y = !C + B*C*D
Since !C is covered, the C in the second term is redundant, so it can be removed.
Y = !C + B*D

 

Because the world is not a fair and just place.

 

Because the world is not a fair and just place.

Amen, brother.

 

i understood the proccess when you took some expression
and transformed it into the minimal formula

i cant understand how did you got this big expression ???

i need some how to build a MUX from this minimal function that i got from tha table (i dont know how)
???

on the other hand i have here
a similar question which is solved by my way (circuling each row)

http://img166.imageshack.us/my.php?image=img8810ev2.jpg

is that a wrong way to solve it like that??