Question: give an algorithm for constructing sum of products representation for an arbitrary logic equation consisting AND, OR, NOT. It should be recursive and should not
give an algorithm for constructing sum of products representation for an arbitrary logic equation consisting AND, OR, NOT. It should be recursive and should not construct truth table in the process
eg OR terms equation can be E = (A.B.C') + (A.C.B') + (B.C.A')
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
