Question 1

-The symbol shown in Figure 4- 2 is a(n)________gate.

Accepted Answer

A)  AND- OR 
B)  AND 
C)  OR 
D)  NAND 
A)  AND- OR 
B)  AND 
C)  OR 
D)  NAND

Question 2

Which of the following is a form of DeMorgan's theorem?

Accepted Answer

A)  X(l) = X 
B)    
C)  X + 0 = 0 
D)    
A)  X(l) = X 
B)    
C)  X + 0 = 0 
D)

Question 3

Which of the following is a correct form of Boolean multiplication?

Accepted Answer

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

Question 4

In Boolean algebra, the expression "_________"means the complement of A.

Accepted Answer

A)  not A 
B)  negative A 
C)  inverse A 
D)  A negative 
A)  not A 
B)  negative A 
C)  inverse A 
D)  A negative

Question 5

Which of the following is a correct form of Boolean addition?

Accepted Answer

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

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

When mapping an SOP expression using a Karnaugh map a 0 is placed in each cell corresponding to the value of the product term.

Accepted Answer

A) True 
 B)False

Question 8

DeMorgan's theorem states that

Accepted Answer

A) True 
 B)False

Question 9

Which of the examples below expresses the distributive law?

Accepted Answer

A)  (A + 
B)  + C = A + (B + 
C)  
B)  A + (B + 
C)  = AB + AC 
C)  A(B
C)  = (A
B)  + C 
D)  A(B + 
C)  = AB + AC 
A)  (A + 
B)  + C = A + (B + 
C)  
B)  A + (B + 
C)  = AB + AC 
C)  A(B
C)  = (A
B)  + C 
D)  A(B + 
C)  = AB + AC

Question 10

When grouping cells within a Karnaugh map, the cells must be combined in groups of _________ .

Accepted Answer

A)  2s 
B)  4s 
C)  3s 
D)  2, 4, 8, etc. 
A)  2s 
B)  4s 
C)  3s 
D)  2, 4, 8, etc.

Question 11

Which statement below best describes a Karnaugh map?

Accepted Answer

A)  The Karnaugh map eliminates the need for using NAND and NOR gates. 
B)  Karnaugh maps provide a graphic approach to simplifying Boolean expressions. 
C)  A Karnaugh map can be used to replace Boolean rules. 
D)  Variable complements can be eliminated by using Karnaugh maps. 
A)  The Karnaugh map eliminates the need for using NAND and NOR gates. 
B)  Karnaugh maps provide a graphic approach to simplifying Boolean expressions. 
C)  A Karnaugh map can be used to replace Boolean rules. 
D)  Variable complements can be eliminated by using Karnaugh maps.

Question 12

The Quine- McCluskey method___________

Accepted Answer

A)  lends itself to computer reduction of Boolean expressions 
B)  can, under certain circumstances, provide incorrect results 
C)  requires fewer steps than Karnaugh mapping 
D)  is described by all of the above 
A)  lends itself to computer reduction of Boolean expressions 
B)  can, under certain circumstances, provide incorrect results 
C)  requires fewer steps than Karnaugh mapping 
D)  is described by all of the above

Question 13

Which of the following expressions is in the product- of sums form?

Accepted Answer

A)  AB + CD 
B)  AB(C
D)  
C)  (A + 
B) (C + 
D)  
D)  (A
B) (C
D)  
A)  AB + CD 
B)  AB(C
D)  
C)  (A + 
B) (C + 
D)  
D)  (A
B) (C
D)

Question 14

The expression for a 3- input NOR gate is _________.

Accepted Answer

A)  X = A/B/C 
B)  X = A · B · C 
C)    
D)    
A)  X = A/B/C 
B)  X = A · B · C 
C)    
D)

Question 15

Which of the Karnaugh maps below represents the expression, X = AC + BC + B?

Accepted Answer

A)  Figure I 
B)  Figure II 
C)  Figure III 
D)  Figure IV 
A)  Figure I 
B)  Figure II 
C)  Figure III 
D)  Figure IV

Question 16

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as in a BCD- to- decimal converter. These result in_________terms in the K- map and can be treated as either _________or_________.

Accepted Answer

A)  spurious, 1s, 0s, 
B)  don't care, 1s, 0s, 
C)  spurious, ANDs, ORs, 
D)  duplicate, 1s, 0s, 
A)  spurious, 1s, 0s, 
B)  don't care, 1s, 0s, 
C)  spurious, ANDs, ORs, 
D)  duplicate, 1s, 0s,

Question 17

According to DeMorgan's theorem,   equals _________ .

Accepted Answer

A)    
B)    
C)  (A + 
B) C 
D)    
A)    
B)    
C)  (A + 
B) C 
D)

Question 18

DeMorgan's theorem states that

Accepted Answer

A) True 
 B)False

Question 19

In Boolean algebra, 1 · 0 = 0.

Accepted Answer

A) True 
 B)False

Question 20

Which of the examples below expresses the associative law of addition?

Accepted Answer

A)  A(B
C)  = (A
B)  + C 
B)  ABC = A + B + C 
C)  A + (B + 
C)  = (A + 
B)  + C 
D)  A + (B + 
C)  = A + (B
C)  
A)  A(B
C)  = (A
B)  + C 
B)  ABC = A + B + C 
C)  A + (B + 
C)  = (A + 
B)  + C 
D)  A + (B + 
C)  = A + (B
C)

-The symbol shown in Figure 4- 2 is a(n)________gate.

Which of the following is a form of DeMorgan's theorem?

Which of the following is a correct form of Boolean multiplication?

In Boolean algebra, the expression "_________"means the complement of A.

Which of the following is a correct form of Boolean addition?

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

When mapping an SOP expression using a Karnaugh map a 0 is placed in each cell corresponding to the value of the product term.

DeMorgan's theorem states that

Which of the examples below expresses the distributive law?

When grouping cells within a Karnaugh map, the cells must be combined in groups of _________ .

Which statement below best describes a Karnaugh map?

The Quine- McCluskey method___________

Which of the following expressions is in the product- of sums form?

The expression for a 3- input NOR gate is _________.

Which of the Karnaugh maps below represents the expression, X = AC + BC + B?

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as in a BCD- to- decimal converter. These result in_____terms in the K- map and can be treated as either _or_____.

According to DeMorgan's theorem, equals _________ .

DeMorgan's theorem states that

In Boolean algebra, 1 · 0 = 0.

Which of the examples below expresses the associative law of addition?

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

-The symbol shown in Figure 4- 2 is a(n)________gate.

Which of the following is a form of DeMorgan's theorem?

Which of the following is a correct form of Boolean multiplication?

In Boolean algebra, the expression "_________"means the complement of A.

Which of the following is a correct form of Boolean addition?

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

When mapping an SOP expression using a Karnaugh map a 0 is placed in each cell corresponding to the value of the product term.

DeMorgan's theorem states that

Which of the examples below expresses the distributive law?

When grouping cells within a Karnaugh map, the cells must be combined in groups of _________ .

Which statement below best describes a Karnaugh map?

The Quine- McCluskey method___________

Which of the following expressions is in the product- of sums form?

The expression for a 3- input NOR gate is _________.

Which of the Karnaugh maps below represents the expression, X = AC + BC + B?

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as in a BCD- to- decimal converter. These result in_________terms in the K- map and can be treated as either _________or_________.

According to DeMorgan's theorem, equals _________ .

DeMorgan's theorem states that

In Boolean algebra, 1 · 0 = 0.

Which of the examples below expresses the associative law of addition?

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

Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as in a BCD- to- decimal converter. These result in_____terms in the K- map and can be treated as either _or_____.