Exam 5: Boolean Circuits
Exam 1: Computation73 Questions
Exam 2: Binary Numbers75 Questions
Exam 3: Octal and Hexadecimal Numbers75 Questions
Exam 4: Sets and Algebra75 Questions
Exam 5: Boolean Circuits74 Questions
Exam 6: Graphs73 Questions
Exam 7: Computer Science and Mathematics97 Questions
Select questions type
Name the property demonstrated in each real variable expression.
-
(Short Answer)
4.9/5
(84)
Sketch the Karnaugh map for the Boolean expression , and then use it to find an equivalent reduced expression.
(Essay)
4.9/5
(83)
Name the property demonstrated in each real variable expression.
-
(Short Answer)
4.8/5
(78)
Give the Boolean expression associated with the following gated
circuit. 
(Short Answer)
5.0/5
(83)
Use the following truth table to complete the exercises.
( , , ) 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 0 0 0 0 0
-Construct a Karnaugh map for this expression and find an
equivalent reduced expression.
(Essay)
4.7/5
(98)
Sketch the Karnaugh map for the Boolean expression
AB′C ∨ AB′C′ ∨ A′BC ∨ A′BC′, and then use it to find an equivalent reduced expression.
(Essay)
4.9/5
(79)
Use Boolean algebra to simplify the following expressions, using x = 0.
-
(Multiple Choice)
4.8/5
(99)
Write the dnf expression corresponding to the shaded areas of the Venn diagram.
(Multiple Choice)
4.9/5
(81)
Use real variable algebra to simplify the following expressions.
-
(Multiple Choice)
4.9/5
(72)
Use Boolean algebra to simplify the following expressions, using x = 0.
-
(Multiple Choice)
4.7/5
(80)
Use real variable algebra to simplify the following expressions.
-
(Short Answer)
4.9/5
(81)
Use Boolean algebra to simplify the following expressions, and then evaluate the expressions for x = 0 and y = 1.
-
(Short Answer)
4.8/5
(69)
Name the property demonstrated in each real variable expression.
-Construct a Karnaugh map for this expression and find an
equivalent reduced expression.
(Essay)
4.9/5
(82)
Use the following truth table to complete the exercises.
( , , ) 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 0 0 0 0 0
-Write the boolean expression in dnf.
(Short Answer)
4.8/5
(86)
Name the property demonstrated in each real variable expression.
-Write the boolean expression in dnf.
(Short Answer)
4.9/5
(78)
Use the following truth table to complete the exercises.
( , , ) 1 1 1 1 1 1 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 1 0 1 0 0 1 0 0 0 0 0
-Sketch the gated circuit that is equivalent to the reduced expression.
(Essay)
4.9/5
(98)
Use Boolean algebra to simplify the following expressions, and then evaluate the expressions for x = 0 and y = 1.
-
(Short Answer)
4.8/5
(84)
Write the Boolean expression associated with each of the following switching circuits.
-
(Multiple Choice)
4.9/5
(63)
Showing 21 - 40 of 74
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)