Filters
Question type
Study Flashcards

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


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

E) None of the above
F) A) and C)

Correct Answer

verifed

verified

The simplest Boolean expression for the Karnaugh map below is _______. The simplest Boolean expression for the Karnaugh map below is _______. A) B) C) X = AC + B D)


A) The simplest Boolean expression for the Karnaugh map below is _______. A) B) C) X = AC + B D)
B) The simplest Boolean expression for the Karnaugh map below is _______. A) B) C) X = AC + B D)
C) X = AC + B
D) The simplest Boolean expression for the Karnaugh map below is _______. A) B) C) X = AC + B D)

E) A) and B)
F) A) and C)

Correct Answer

verifed

verified

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


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.

E) All of the above
F) A) and B)

Correct Answer

verifed

verified

C

The symbol shown below is a(n) ______ and the output will be______ for the input shown. The symbol shown below is a(n) ______ and the output will be______ for the input shown. A) inverter, 1 B) inverter, C) buffer, not A D) buffer, 1


A) inverter, 1
B) inverter, The symbol shown below is a(n) ______ and the output will be______ for the input shown. A) inverter, 1 B) inverter, C) buffer, not A D) buffer, 1
C) buffer, not A
D) buffer, 1

E) B) and C)
F) A) and D)

Correct Answer

verifed

verified

B

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

A) True
B) False

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

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


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.

E) C) and D)
F) A) and D)

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

Boolean multiplication is symbolized by A + B.

A) True
B) False

Correct Answer

verifed

verified

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.


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

E) A) and B)
F) C) and D)

Correct Answer

verifed

verified

Which of the figures is the DeMorgan equivalent of the Reference Circuit shown below? Which of the figures is the DeMorgan equivalent of the Reference Circuit shown below? A) Figure (A) B) Figure (B) C) Figure (C) D) Figure (D)


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

E) A) and C)
F) None of the above

Correct Answer

verifed

verified

For the network shown below, the boolean expression for X is _________. For the network shown below, the boolean expression for X is _________. A) D(A + B + C) B) ((A + B) · C) + D C) (AC + BC) D D) A + BC + D


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

E) A) and B)
F) A) and C)

Correct Answer

verifed

verified

-The Boolean expression for the symbol in Figure 4- 3 is . A) X = AB + BC B) X = A + B + C + D C) X = (A +B) (B + C) D) X = ABCD -The Boolean expression for the symbol in Figure 4- 3 is .


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

E) C) and D)
F) A) and B)

Correct Answer

verifed

verified

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

A) True
B) False

Correct Answer

verifed

verified

Which rule of Boolean algebra does the figure below illustrate? Which rule of Boolean algebra does the figure below illustrate? 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

E) A) and D)
F) All of the above

Correct Answer

verifed

verified

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


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

E) A) and D)
F) A) and C)

Correct Answer

verifed

verified

The figure below represents one line from the truth table for a two- input NAND gate. 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? A) B B) 1 C) 0 D) not A For the inputs shown, what is the value of X?


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

E) None of the above
F) A) and B)

Correct Answer

verifed

verified

B

The Karnaugh maps provide graphic approaches to simplifying Boolean expressions.

A) True
B) False

Correct Answer

verifed

verified

The complement of 1 is 0.

A) True
B) False

Correct Answer

verifed

verified

Showing 1 - 20 of 46

Related Exams

Exam 1

Introductory Concepts

75 Questions

Exam 2

Number Systems, Operations, and Codes

49 Questions

Exam 3

Logic Gates

56 Questions

Exam 5

Combinational Logic Analysis

38 Questions

Exam 6

Functions of Combinational Logic

46 Questions

Exam 7

Latches, Flip-Flops, and Timers

38 Questions

Exam 8

Shift Registers

40 Questions

Exam 9

Counters

50 Questions

Exam 10

Programmable Logic

30 Questions

Exam 11

Data Storage

49 Questions

Exam 12

Signal Conversion and Processing

46 Questions

Exam 13

Data Transmission

99 Questions

Exam 14

Data Processing and Control

127 Questions

Exam 15

Integrated Circuit Technologies

40 Questions

Show Answer