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
Use real variable algebra to simplify the following expressions.
-
(Short Answer)
4.8/5
(32)
Name the property demonstrated in each real variable expression.
-
(Multiple Choice)
4.9/5
(39)
Write each of the Boolean functions as a Boolean expression in dnf.
- ( , ) 1 1 1 1 0 0 0 1 1 0 0 0
(Multiple Choice)
4.8/5
(24)
Write the reduced expressions for the following Karnaugh map.
-

(Multiple Choice)
4.7/5
(31)
Write the reduced expression for the following Karnaugh map. AB A B CD C 1 1 1 1 1 1 D
(Short Answer)
4.9/5
(40)
Name the property demonstrated in each Boolean variable expression.
-
(Multiple Choice)
4.8/5
(27)
Name the property demonstrated in each real variable expression.
-Sketch the switching circuit that is equivalent to the Boolean expression.
(Essay)
4.9/5
(34)
Name the property demonstrated in each real variable expression.
-
(Multiple Choice)
4.9/5
(39)
Sketch the switching circuit associated with each of the following Boolean expressions.
-
(Essay)
4.9/5
(37)
Use real variable algebra to simplify the following expressions.
-
(Short Answer)
4.9/5
(40)
Sketch the switching circuit associated with each of the following Boolean expressions.
-
(Essay)
4.7/5
(35)
Write the Boolean expression for the following switching
circuit, then sketch the equivalent truth table. 

(Short Answer)
4.7/5
(35)
Name the property demonstrated in each Boolean variable expression.
-
(Multiple Choice)
4.7/5
(37)
Showing 61 - 74 of 74
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)