Unit 4: Boolean Algebra and Logic Analysis
Which of the following is a correct form of Boolean addition?
0 + 1 = 1
Which of the following gates would you need to build the SIMPLIFIED circuit above? Original expression: AB+A(B+C)
1 AND, 1 OR
How many two-input NAND gates are required to produce a two-input exclusive or gate?
4
Combinational logic is an interconnection of logic gates to generate a specified logic function where the inputs result in an immediate output.
8
What is the SIMPLIFIED Boolean expression for the following 3-input logic diagram?
A ( B + C )
Simplify the following Boolean expression: AB+A(B+C)
A (B + C)
Which of the examples below expresses the associative law of addition?
A + (B + C) = (A + B) + C
What is the SIMPLIFIED Boolean expression for the following logic diagram?
A + B
Which of the following could be a Boolean expression for a three-input OR gate?
A + B + C = Y
In Boolean algebra, the expression "__________" means the complement of A. (Select all correct answers.)
A not, inverse of A
The following logic circuit is equivalent to:
A single OR gate
For the SIMPLIFIED circuit above, the final output if from which kind of gate? Original expression: AB+A(B+C)
AND
Which circuit is the logical equivalent of the Reference Circuit?
B
When mapping an SOP expression using a Karnaugh map a 0 is placed in each cell corresponding to the value of the product term. (T/F)
False
Boolean multiplication is symbolized by A + B. (T/F)
False. Boolean multiplication is symbolized by A * B.
AND gates are often used to wire combinational logic circuits because they are easy to use and readily available. (T/F)
False. NAND gates are often used to wire combinational logic circuits because they are easy to use and readily available.
The commutative law of Boolean addition states that A + B = A * B. (T/F)
False. The commutative law of Boolean addition states that A + B = B + A.
The truth table is a precise method of describing how an analog circuit works. (T/F)
False. The truth table is a precise method of describing how an digital circuit works.
When a two-input NAND gate has inputs of 1 and 0, the output is 0. (T/F)
False. When a two-input NAND gate has inputs of 1 and 0, the output is 1.
Which of the Karnaugh maps below represents the expression, X = AC + BC + B?
III
For the SIMPLIFIED circuit above, the "C" input is connected to which kind of gate? Original expression: AB+A(B+C)
OR
De Morgan's theorems help to eliminate long overbars that cover several variables. (T/F)
True
DeMorgan's theorem states that (X+Y)' = X'Y'. (T/F)
True
For the circuit below, X = 0 whenever A = 0, regardless of the levels applied to B and C. (T/F)
True
In Boolean algebra, 1 * 0 = 0 (T/F)
True
Karnaugh mapping is an easy-to-use graphic method of simplifying Boolean expressions. (T/F)
True
The Boolean expression for a three-input AND gate is: x = ABC. (T/F)
True
The terms complemented and inverted mean the same thing. (T/F)
True
The truth table for four variables has 16 possible combinations. (T/F)
True
Which statement below best describes a Karnaugh map?
Variable complements can be eliminated by using Karnaugh maps
The Boolean expression for the symbol below is:
X = ABCD
A plus symbol with a circle around it is the Boolean operator for which kind gate?
XOR
Which of the following is a form of Boolean expressions?
sum-of-products
