From utilizing the simulation for task #3, I have ardously discovered the program proved De Morgan's Law as true because the equation (a and b)= not a or b are the same. For example, I took output 1 "A Not And B" and it was the same for output 2 which is "Not A OR Not B" Even though I interchanged the inputs, both outputs came out with the same result. Tuesday, March 6, 2007
From utilizing the simulation for task #3, I have ardously discovered the program proved De Morgan's Law as true because the equation (a and b)= not a or b are the same. For example, I took output 1 "A Not And B" and it was the same for output 2 which is "Not A OR Not B" Even though I interchanged the inputs, both outputs came out with the same result. 
Subscribe to:
Post Comments (Atom)
1 comment:
good post! I guess you forgot to depict the truth table for this one. Indeed,a comparison of truth tables is the only practical way we can tell for sure if two logic circuits are equivalent.
There are other methods using theoretical means using which you can do that as well.
--Bharat
Post a Comment