what you said holds true for this scenario.But if you use the same algorithm you won't be able to get the proper result in all cases.Hence to make a universal algorithm we make a singular cover of each gate and try to come up with the logic which holds true for every case. Thanks
The examples are so clear, thank you.
Was pulling my hair out with the notes I got from my teacher
picture is not clear .
The h node: xor, why the output must D, if you give f is 1, then h : D' , again, why PO must D', if you give k is 0 then PO would be D. ??
what you said holds true for this scenario.But if you use the same algorithm you won't be able to get the proper result in all cases.Hence to make a universal algorithm we make a singular cover of each gate and try to come up with the logic which holds true for every case.
Thanks
Figures can be made bigger.