Computer Science, asked by khushidreamer312003, 6 months ago

what are DeMorgon's theorams? prove algebraically the DeMorgon's theorams.

Answers

Answered by manish08102004
0

Explanation:

As we have seen previously, Boolean Algebra uses a set of laws and rules to define the operation of a digital logic circuit with “0’s” and “1’s” being used to represent a digital input or output condition. Boolean Algebra uses these zeros and ones to create truth tables and mathematical expressions to define the digital operation of a logic AND, OR and NOT (or inversion) operations as well as ways of expressing other logical operations such as the XOR (Exclusive-OR) function.

Similar questions