Estás en modo de exploración. debe iniciar sesión para usar MEMORY

level: Boolean (NEED)

Questions and Answers List

Question	Answer
What does this boolean identity simplify down to: X . 1	X
What does this boolean identity simplify down to: X . 0	0
What does this boolean identity simplify down to: X + 1	1
What does this boolean identity simplify down to: X + 0	X
What does this boolean identity simplify down to: _ _ X	X
What does this boolean identity simplify down to: X . X	X
What does this boolean identity simplify down to: X + X	X
What does this boolean identity simplify down to: _ X . X	0
What does this boolean identity simplify down to: _ X + X	1
State what the commutative rule is	For AND and OR, it doesnt matter which side of the operator an operand is on
Give an example of what the commutative rule is in action	X + Y = Y + X
What is the associative rule?	A law that allows the removal of brackets from an expression and regrouping of the variables of alike operations
Give an example of the associative rule	X + (Y + Z) = (X + Y) + Z = X + Y + Z
Represent an XOR as a boolean expression	or (X + Y) . NOT(X . Y)
Give an example of absrption law	B + (B . C) B
Whats the order of operations	Brackets Not And Or
Distrubtive law	Allow of factorising or multiplying an expression
Simplify (X + Y) . (X + ( NOT Y ))	D