This test is run by .
Note that your final mark will not be saved in the system.
Note that your final mark will not be saved in the system.
11. Boolean Algebra MatchUp
Target Level
C
Running Total
0
0%
Attempt
1 of 3
Click on a top box, then click on its match below. Or, drag a top box and drop it onto the correct match. Match all pairs before clicking ‘Check’.
Commutation
Double negation
Logic gates
True
Distribution
Association
Truth table
Boolean expression
Half adder
Full adder
Karnaugh map
False
De Morgan's law
A law of Boolean algebra evident in the assertion that 'A and B' is essentially the same as 'B and A'.
This type of Boolean algebra law can be considered the Boolean equivalent of multiplying out the brackets.
A table, useful in simplifying Boolean expressions, in which rows represent one set of inputs, and columns represent another.
A Boolean algebra law that would be seen by the effect of a Boolean expression remaining the same if (a) that expression contained only AND operators and (b) brackets were added, removed or repositioned.
To paraphrase a Boolean algebra law into the context of light switches… If we say switch A must be on and switch B must be on, we could also say that neither switch A nor switch B can be off. Which law?
A table, useful in simplifying Boolean expressions, in which each of the inputs occupies a column.
This Boolean algebra law tells us that NOT(NOT(A)) can be simplified to simply 'A'.
Logic circuit that consists of two XOR gates, two AND gates and an OR gate
Logical statement that returns either TRUE or FALSE.
Logical operations performed on one or more binary inputs to produce a single binary output.
Boolean value commonly represented by the number 0.
Boolean value commonly represented by the number 1.
Logic circuit that consists of an XOR gate and an AND gate