Note: $+$ is OR operation, $.$ is AND operation, and $'$ is NOT operation
The question asks to identify which of the given options is not a property of Boolean Algebra. We need to evaluate each option based on the standard laws of Boolean Algebra.
This is the Commutative Law for the OR operation. It holds true in Boolean Algebra.
This statement represents a variable ANDed with its complement resulting in 1. The actual property of Boolean Algebra is the Complement Law, which states $a . a' = 0$. Therefore, this option is not a property of Boolean Algebra.
This is the Complement Law for the OR operation. It states that a variable ORed with its complement always results in 1. This holds true in Boolean Algebra.
This is the Commutative Law for the AND operation. It holds true in Boolean Algebra.
This option is undefined and cannot be considered a property.
The option $a . a' = 1$ contradicts the fundamental Complement Law ($a . a' = 0$) of Boolean Algebra. Hence, it is the correct answer as it is not a property.
How many different Boolean functions of degree n are there?
Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is:
The marginal probability of cavity P(cavity) is ________.
The probability of a cavity, given evidence of a toothache, P(cavity | toothache) is _________.
The probability of a toothache, given evidence of a cavity, P(toothache | cavity) is ________.