Basing on that problem. All I have in my solution is this:
mystep1:[AB(C +(B' + C')) + AB']CD'
mystep2:[AB(CB'+ CC') + AB']CD'
mystep3: [AB(CB') + AB']CD'
mystep4:[B(A+C+B') + AB']CD'
mystep5:[AB + AC + AB'] CD'
mystep6:[AC]CD'
mystep7: ACD'
F = ACD' (my simplified answer)
Please do tell me if I have followed all the necessary rules and I have the correct answer.. I am doubtful with this. For I have tried plotting it on livewire(software for logical designs) and then tried kmapping for much more easier and faster simplification. I got different answers. I believe I have wrong plots on my logical design. But this Step-by-step solution of mine is also hanging. Really not sure.
step1 > [AB (C + (B' + C')) + AB'] CD' step2 > [AB ((C + C') + B') + AB'] CD' step3 > [AB ((1) + B') + AB'] CD' step4 > [AB (1 + B') + AB'] CD' step5 > [AB + AB'] CD' step6 > ABCD' + AB'CD' step7 > ACD' + ACD' step8 > ACD' ---> FINAL ANSWER
First off, This time is this correct? Second question, What is this rule again? (1 + B) = 1 or (1 + B') = 1 Third, This will result to cancelling them when you're into solutions right?
– Sha Lala Sep 18 '13 at 19:15Note: I tried to show every process so that it's really clear for others also for me. I needed to see where are things going.
– Sha Lala Sep 19 '13 at 14:33