CET Digital Technology Homework #4

downloaded from

Scholarfriends

https://scholarfriends.com

Downloaded by: browsegrades@gmail.com | https://scholarfriends.com/singlePaper/206737/cet-digital-technology-homework-4 Distribution of this document is illegal.

CET Digital Technology Homework #4 Question 1

2 / 2 points

This is the logic symbol for a(n) ________.

AND gate NAND gate OR gate None of the above Question 2

This is the logic symbol for a(n) ________.

Inverter OR gate AND gate None of the above Question 3

This is the logic symbol for a(n) ________.

OR gate AND gate NOR gate NAND gate Question 4

This is the logic symbol for a(n) ________.

OR gate NAND gate AND gate Inverter Question 5

This is the truth table for a(n) ________.

AND gate NOR gate OR gate NAND gate Question 6

This is the truth table for a(n) ________.

NAND gate OR gate AND gate NOR gate Question 7

This is the truth table for a(n) ________.

OR gate NAND gate NOR gate AND gate Question 8

This is the truth table for a(n) ________.

AND gate NAND gate NOR gate OR gate Question 9

Which of these truth tables represents the Exclusive-NOR gate?

(A) (B) (C) (D) Question 10

This is the timing diagram for a 2-input ________ gate.

Exclusive-OR AND OR NAND Question 11

This is the timing diagram for a 2-input ________ gate.

AND Exclusive-OR OR NAND Question 12

This is the timing diagram for a 2-input ________ gate.

NAND Exclusive-OR OR AND Question 13

This is the timing diagram for a 2-input ________ gate.

Exclusive-NOR AND NOR OR Question 14

This is the timing diagram for a 2-input ________ gate.

AND NAND Exclusive-NOR Exclusive-OR Question 15

This is the timing diagram for a 2-input ________ gate.

Exclusive-NOR Exclusive-OR NAND AND Question 16 In Boolean algebra, the expression "________" means the complement of A. A negative not A negative A inverse A

Question 17 The figure below represents one line from the truth table for a two-input NAND gate.

A B| X 1 0| ?

For the inputs shown, what is the value of X? B 0 1 not A Question 18 The expression for a 3-input NOR gate is ________.

(A + B + C)' A∙B∙C A+B+C A/B/C Question 19 Which of the examples below expresses the commutative law of product?

A+B=B+A AB = BA AB = A + B

AB = B'A' Question 20 Which of the examples below expresses the associative law of addition?

A + (B + C) = (A + B) + C A + (B + C) = A + (BC)

ABC = A + B + C A(BC) = (AB) + C Question 21 Which of the examples below expresses the distributive law?

A(BC) = (AB) + C A + (B + C) = AB + AC (A + B) + C = A + (B + C) A(B + C) = AB + AC Question 22

Which rule of Boolean algebra does the figure below represent?

A+1=1 A+0=A A∙0=0 A∙1=A Question 23 Which of the following is a form of DeMorgan's theorem?

X(l) = X'

X' + Y = X + Y' X+0=0 (XY)' = X' + Y' Question 24

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

Figure (A)

Figure (B)

Figure (C) Figure (D) Question 25 According to DeMorgan's theorem, ((AB)' + C')' equals ________.

A'+B'+C'

(A + B)C

ABC

AB + C Question 26

For the network shown above, the boolean expression for X is ________. ((A + B) ∙ C) + D A + BC + D D(A + B + C) (AC + BC)D Question 27 Which of the following expressions is in the sum-of-products form?

AB(CD) AB + CD (AB)(CD) (A + B)(C + D) Question 28 Which of the following is an important feature of the sum-of-products form of expressions?

The delay times are greatly reduced over other forms.

No signal must pass through more than 2 gates, not including inverters.

The maximum number of gates that any signal must pass through is reduced by a factor of two.

All logic circuits are reduced to nothing more than simple AND and OR gates.

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

(A + B)(C + D) AB + CD AB(CD) (AB)(CD) Question 30 What is the primary motivation for using Boolean algebra to simplify logic expressions?

May reduce the number of inputs required.

May make it easier to understand the circuit.

May reduce the number of gates.

All of the above are correct.

Question 31

Which of the circuits above is equivalent to the Reference Circuit?

Figure (A) Figure (D) Figure (C) Figure (B) Question 32 How many truth table entries are required for a four-input circuit?

12 8 4 16 Question 33

0/2 points

Suppose that a logic gate has 3 inputs. How many possible input combinations must be listed in its accompanying truth table?

810 210 410 1610 Question 34

Which of the following accurately describes the logic circuit for the Boolean expression given above?

A 2-input OR gate and a 3-input OR gate whose outputs are fed to a 2-input AND gate.

A 2-input NOR gate and a 3-input NOR gate whose outputs are fed to a 2-input AND gate.

A 2-input AND gate and a 3-input AND gate whose outputs are fed to a 2-input NOR gate.

A 2-input NAND gate and 3-input NAND gate whose outputs are fed to a 2-input OR gate.

Question 35

Which of the following groups of logic devices would be required to implement the expression for X given above? two 3-input AND gates, one 2-input AND gate, one 3-input OR gate, and two inverters three 3-input AND gates, one 3-input OR gate, and two inverters two 3-input AND gates, two 3-input OR gates, and three inverters three 3-input AND gates, two 3-input OR gates, and two inverters Question 36 A small circle on the output of a logic gate is used to represent the: OR operation.

AND operation.

NOT operation.

Comparator operation.

Question 37

Which of the options above represents the Boolean expressions of a four input AND gate followed by an inverter?

Option a)

Option b)

Option c)

Option d) Question 38

Select the option that corresponds to the Boolean equivalent to the expression Y given above Option a)

option b)

Option c)

Option d) Question 39 How many NAND gates would be required to perform the OR operation if two inputs are required? two three one four Question 40

If you apply DeMorgan's theorem to the expression above , you get: Option a)

Option b)

Option c)

Option d) Question 41 How many different Boolean Functions can be possible with 4 variables?

Answer: (65,536, 2^16, 65536) Question 42 Simplify the following expression: (X+Y'Z) + (X+Y'Z)' X + Y'Z

YZ'

1

0 Question 43 In the following simplification: AB+(C'+D)(AB)'=AB+C'+D what theorem was used if only took one step.

Absorption

Elimination

DeMorgans

Uniting Question 44 In the following simplification: (UV'+W'X)(UV'+W'X+Y'Z)=UV'+W'X what theorem was used if only took one step.

Absorption

Elimination

DeMorgans

Uniting Question 45 In the following simplification: (W'+X)(Y+Z')+(W'+X)'(Y+Z')=(Y+Z') what theorem was used if only took one step.

Uniting

Absorption

DeMorgans

Elimination