Test #1

Question 1

How many different symbols do we have that represents the two-input NAND gate?
1
2
3
4
5

Answer 1

2

Question 2

(T/F) A two-input NOR gate may be used as a one-input inverter.

Answer 2

True

Question 3

(T/F) Let F(A,B,C) = A’B’C’ + AB’C’ + A’BC’ + ABC’

Using Boolean algebra rules, F(A,B,C,D) can be reduced to the simplest form below:

F(A,B,C) = BC’

Answer 3

False

Question 4

(T/F) DeMorgan’s Law states the following:

(AB)’ = A’B’

and

(A+B)’ = A’+B’

Answer 4

False

Question 5

Find the simplest reduced SOP equation for the Boolean function given below through the use of a K-map:

F(A,B,C,D) = m(0, 1,2, 3, 7, 9, 11, 15)

A’B’ + CD + AB’D
A’B’ + BCD + AB’D
A’B’ + BCD + B’D
A’B’ +CD +B’D
None of these

Answer 5

A’B’ + CD + B’D

Question 6

Find the simplest reduced POS equation for the Boolean function given below through the use of a K-map:

F(A,B,C,D) = m(0, 1,2, 3, 7, 9, 11, 15)

(B’+D) (B’ + D)
(B’+C) (B’ + D) (A’ + B)
(B’+C) (B’ + D) (A’ + D)
(B’+C) (B’ + D) (A’ + C)
None of these

Answer 6

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

Question 7

Find the simplest reduced SOP equation for the Boolean function given below. Use K-maps to reduce.

F(A,B,C,D) = m(0, 2, 4, 5, 6, 8, 12, 14, 15)

d(A,B,C,D) = m(7, 10, 13)

B + C’D’ + CD’
AB + AC + Bd
AB +CD’
B + D’
None of these

Answer 7

B + D’

Question 8

We have several ways to represent a Binary circuit.

Which of the following are unique?

Circuit
Boolean equation
Truth Table
Minterm notation
None of these

Answer 8

Truth Table
Minterm Notation

Question 9

Given the Boolean function below, how many 1’s are in the truth table for this function?

F(A,B,C,D) = A’C’ +A’BD + AD’ +ABC’

Answer 9

10

Question 10

(T/F) A two-input AND gate may be built from multiple NAND gates.

Answer 10

True

Question 11

(T/F) For TTL chips, power is typically applied to pin 7 and ground is applied to pin 14.

Answer 11

False

Question 12

(T/F) High and low in TTL chips are represented by different current levels.

Answer 12

False

Question 13

The sum of the two binary numbers 11001 and 10111 is what?

Answer 13

110000

Question 14

Suppose you wire up a 7408 AND chip correctly to power and ground. Suppose also you connect data input pin 2 to 5 volts and you connect data output pin 3 to an LED. Suppose you leave data input pin 1 disconnected. When you turn on the power to the system, what will you see on the LED?

LED is lit
LED is not lit

Answer 14

LED is lit

Question 15

Convert the decimal number 399 to binary.

101001111
111101111
111001111
11001111
110001111

Answer 15

110001111

Question 16

Which of the following gates produces just a single high output over all the possible inputs? Select all that apply.

AND
OR
NAND
NOR
XOR

Answer 16

AND
NOR

Question 17

Write the following binary number in hexadecimal notation:

1001000111110011

91E2
91F3
8FF1
8FFB
None of these

Answer 17

91F3

Question 18

What Boolean function did we construct in Lab 2?

NAND
NOR
exclusive NOR
exclusive OR
None of these

Answer 18

exclusive OR

Question 19

In Lab #1, we discovered that a disconnected input is treated as a low.

Answer 19

False

Question 20

In Boolean algebra, X + X = X

Answer 20

True

Question 21

What fundamental gate is assigned the lowest number in the TTL family of chips?

AND
OR
NAND
NOR

Answer 21

NAND

Question 22

The following Boolean function is in normal form:

F(A,B,C) = A’BC + AB + AB’C’

Answer 22

False

Question 23

We can use the NOR gate exclusively to implement a reduced POS Boolean equation

Answer 23

True

Question 24

The octal number 347 (base 8) is what number written in hexadecimal notation?

E7
A7
C6
B5
None of these

Answer 24

E7

Question 25

The truth table below represents what fundamental gate?

A B F

0 0 0

0 1 1

1 0 1

1 1 0

Answer 25

XOR

Question 26

Minterm notation is a shorthand notation we may use to represent a Boolean function

Answer 26

True

Question 27

We have studies three ways to reduce a Boolean expression to its lowest terms

Answer 27

False

Question 28

Which fundamental gates are represented by two different symbols?

AND
OR
NAND
NOR
exclusive NOR

Answer 28

NAND
NOR

Question 29

What fundamental gate is represented by the following truth table:

A B F

0 0 1

0 1 1

1 0 1

1 1 0

Answer 29

NAND

Question 30

(AB + C) ( B + C’D) is in SOP form

Answer 30

False

Question 31

A combinational circuit may be represented by an extended truth table with n-input columns and m-output columns, n = 1, 2, 3. m = 1, 2, 3,…

Answer 31

True

Question 32

Every Boolean function may be classified as a combinational circuit

Answer 32

True

Question 33

A Half-Adder combinational circuit adds two binary bits together generating a Sum bit and a Carry bit

Answer 33

True

Question 34

In Lab 3, we built an even-parity generator for a 3-bit word. For this circuit, given an input of “010”, what would be output?

Answer 34

1

Question 35

A Full Adder combinational circuit adds two binary bits together generating a Sum bit and a Carry bit.

Answer 35

False

Question 36

Which TTL gate has pins 2 and 3 as data inputs and pin 1 as data output?

Answer 36

NOR

Question 37

For Boolean variables, X and X = X

Answer 37

True

Question 38

For Boolean variables, X and 0 = X

Answer 38

False