Question 1

Which of the following is an important feature of the sum- of- products form of expressions?

Accepted Answer

A)  The maximum number of gates that any signal must pass through is reduced by a factor of two. 
B)  The delay times are greatly reduced over other forms. 
C)  No signal must pass through more than 2 gates (not including inverters). 
D)  All logic circuits are reduced to nothing more than simple AND and OR gates. 
A)  The maximum number of gates that any signal must pass through is reduced by a factor of two. 
B)  The delay times are greatly reduced over other forms. 
C)  No signal must pass through more than 2 gates (not including inverters). 
D)  All logic circuits are reduced to nothing more than simple AND and OR gates. C

Question 2

The symbol shown below is a(n)______ and the output will be______ for the input shown.

Accepted Answer

A)  inverter, 1 
B)  inverter,   
C)  buffer, not A 
D)  buffer, 1 
A)  inverter, 1 
B)  inverter,   
C)  buffer, not A 
D)  buffer, 1 B

Question 3

The figure below represents one line from the truth table for a two- input NAND gate.
 
For the inputs shown, what is the value of X?

Accepted Answer

A)  B 
B)  1 
C)  0 
D)  not A 
A)  B 
B)  1 
C)  0 
D)  not A B

Question 4

The Boolean expression X = ABC describes a three- input AND gate.

Accepted Answer

A) True 
 B)False

Question 5

For the network shown below, the boolean expression for X is _________.

Accepted Answer

A)  D(A + B + 
C)  
B)  ((A + 
B)  · 
C)  + D 
C)  (AC + B
C) D 
D)  A + BC + D 
A)  D(A + B + 
C)  
B)  ((A + 
B)  · 
C)  + D 
C)  (AC + B
C) D 
D)  A + BC + D

Question 6

The complement of 1 is 0.

Accepted Answer

A) True 
 B)False

Question 7

Which of the following combinations cannot be combined into Karnaugh- map groups?

Accepted Answer

A)  Corners in the same row 
B)  Diagonal corners 
C)  Corners in the same column 
D)  Overlapping combinations 
A)  Corners in the same row 
B)  Diagonal corners 
C)  Corners in the same column 
D)  Overlapping combinations

Question 8

-The Boolean expression for the symbol in Figure 4- 3 is 	.

Accepted Answer

A)  X = AB + BC 
B)  X = A + B + C + D 
C)  X = (A +
B)  (B + 
C)  
D)  X = ABCD 
A)  X = AB + BC 
B)  X = A + B + C + D 
C)  X = (A +
B)  (B + 
C)  
D)  X = ABCD

Question 9

Boolean multiplication is symbolized by A + B.

Accepted Answer

A) True 
 B)False

Question 10

Which of the examples below expresses the commutative law of multiplication?

Accepted Answer

A)  AB = BA 
B)  AB = A ÷ B 
C)  AB = B + A 
D)  A + B = B + A 
A)  AB = BA 
B)  AB = A ÷ B 
C)  AB = B + A 
D)  A + B = B + A

Question 11

Which of the figures is the DeMorgan equivalent of the Reference Circuit shown below?

Accepted Answer

A)  Figure (
A)  
B)  Figure (
B)  
C)  Figure (
C)  
D)  Figure (
D)  
A)  Figure (
A)  
B)  Figure (
B)  
C)  Figure (
C)  
D)  Figure (
D)

Question 12

The simplest Boolean expression for the Karnaugh map below is _______.

Accepted Answer

A)    
B)    
C)  X = AC + B 
D)    
A)    
B)    
C)  X = AC + B 
D)

Question 13

Which rule of Boolean algebra does the figure below illustrate?

Accepted Answer

A)  A · 1 = A 
B)  A + 1 = 1 
C)  A · 0 = 0 
D)  A + 0 = A 
A)  A · 1 = A 
B)  A + 1 = 1 
C)  A · 0 = 0 
D)  A + 0 = A

Question 14

The commutative law of Boolean algebra states that A + B = A · B.

Accepted Answer

A) True 
 B)False

Question 15

When a two- input NAND gate has inputs of 1 and 0, the output is 0.

Accepted Answer

A) True 
 B)False

Question 16

What is the primary motivation for using Boolean algebra to simplify logic expressions?

Accepted Answer

A)  It may reduce the number of inputs required. 
B)  It may reduce the number of gates. 
C)  It may make it easier to understand the circuit. 
D)  All of the above are correct. 
A)  It may reduce the number of inputs required. 
B)  It may reduce the number of gates. 
C)  It may make it easier to understand the circuit. 
D)  All of the above are correct.

Question 17

-According to the distributive law, Figure 4- 1 shows one possible logic implementation of the expression X = A(B+C).

Accepted Answer

A) True 
 B)False

Question 18

The Product- of- Sum (POS) form is a standard form of Boolean expression.

Accepted Answer

A) True 
 B)False

Question 19

The Karnaugh maps provide graphic approaches to simplifying Boolean expressions.

Accepted Answer

A) True 
 B)False

Question 20

The Quine- McCluskey method of reducing complex Boolean expressions is used in place of a Karnaugh map when the original expression contains_________ or more variables.

Accepted Answer

A)  5 
B)  8 
C)  6 
D)  4 
A)  5 
B)  8 
C)  6 
D)  4

Which of the following is an important feature of the sum- of- products form of expressions?

The symbol shown below is a(n) and the output will be for the input shown.

The figure below represents one line from the truth table for a two- input NAND gate. For the inputs shown, what is the value of X?

The Boolean expression X = ABC describes a three- input AND gate.

For the network shown below, the boolean expression for X is _________.

The complement of 1 is 0.

Which of the following combinations cannot be combined into Karnaugh- map groups?

-The Boolean expression for the symbol in Figure 4- 3 is .

Boolean multiplication is symbolized by A + B.

Which of the examples below expresses the commutative law of multiplication?

Which of the figures is the DeMorgan equivalent of the Reference Circuit shown below?

The simplest Boolean expression for the Karnaugh map below is _______.

Which rule of Boolean algebra does the figure below illustrate?

The commutative law of Boolean algebra states that A + B = A · B.

When a two- input NAND gate has inputs of 1 and 0, the output is 0.

What is the primary motivation for using Boolean algebra to simplify logic expressions?

-According to the distributive law, Figure 4- 1 shows one possible logic implementation of the expression X = A(B+C).

The Product- of- Sum (POS) form is a standard form of Boolean expression.

The Karnaugh maps provide graphic approaches to simplifying Boolean expressions.

The Quine- McCluskey method of reducing complex Boolean expressions is used in place of a Karnaugh map when the original expression contains_________ or more variables.

Introductory Concepts

Number Systems, Operations, and Codes

Logic Gates

Combinational Logic Analysis

Functions of Combinational Logic

Latches, Flip-Flops, and Timers

Shift Registers

Counters

Programmable Logic

Data Storage

Signal Conversion and Processing

Data Transmission

Data Processing and Control

Integrated Circuit Technologies

Filters

Exam 4: Boolean Algebra and Logic Simplification

Which of the following is an important feature of the sum- of- products form of expressions?

The symbol shown below is a(n)______ and the output will be______ for the input shown.

The figure below represents one line from the truth table for a two- input NAND gate. For the inputs shown, what is the value of X?

The Boolean expression X = ABC describes a three- input AND gate.

For the network shown below, the boolean expression for X is _________.

The complement of 1 is 0.

Which of the following combinations cannot be combined into Karnaugh- map groups?

-The Boolean expression for the symbol in Figure 4- 3 is .

Boolean multiplication is symbolized by A + B.

Which of the examples below expresses the commutative law of multiplication?

Which of the figures is the DeMorgan equivalent of the Reference Circuit shown below?

The simplest Boolean expression for the Karnaugh map below is _______.

Which rule of Boolean algebra does the figure below illustrate?

The commutative law of Boolean algebra states that A + B = A · B.

When a two- input NAND gate has inputs of 1 and 0, the output is 0.

What is the primary motivation for using Boolean algebra to simplify logic expressions?

-According to the distributive law, Figure 4- 1 shows one possible logic implementation of the expression X = A(B+C).

The Product- of- Sum (POS) form is a standard form of Boolean expression.

The Karnaugh maps provide graphic approaches to simplifying Boolean expressions.

The Quine- McCluskey method of reducing complex Boolean expressions is used in place of a Karnaugh map when the original expression contains_________ or more variables.

Introductory Concepts

Number Systems, Operations, and Codes

Logic Gates

Combinational Logic Analysis

Functions of Combinational Logic

Latches, Flip-Flops, and Timers

Shift Registers

Counters

Programmable Logic

Data Storage

Signal Conversion and Processing

Data Transmission

Data Processing and Control

Integrated Circuit Technologies

Filters

The symbol shown below is a(n) and the output will be for the input shown.