Test 2

Question 1

The output depends only on the input

Answer 1

Combinational circuit

Question 2

Black box representation of a circuit

Answer 2

In                        Out
          \_\_\_\_\_\_\_\_
a ->   |              | -> x
b ->   |              |
c ->   |\_\_\_\_\_\_\_| -> y

Question 3

Methods to describe a combinational circuit

Answer 3

Truth table
Boolean algebraic expression
Logic diagram

Question 4

Lists the output for every combination of the input

Answer 4

Truth table

Question 5

is a mathematical system for the manipulation of variables that can have one of two values. Returns true or false

Answer 5

Boolean algebra

Question 6

Boolean operator examples

Answer 6

AND
OR
NOT

Question 7

contain circuits that implement Boolean functions.

Answer 7

Digital computers

Question 8

The _______ that we can make a Boolean function, the ______ the circuit that will result.

Answer 8

simpler

smaller

Question 9

Through our exercises in simplifying Boolean expressions, we see that there are _________ ways of stating the same Boolean expression.

Answer 9

numerous

Question 10

These “synonymous” forms are

Answer 10

logically equivalent.

Question 11

Logically equivalent expressions have ________ truth tables

Answer 11

identical

Question 12

In order to eliminate as much confusion as possible, designers express Boolean functions in:

Answer 12

standardized or canonical form.

Question 13

There are two canonical forms for Boolean expressions:

Answer 13

sum-of- products and product -of-sums.

Question 14

In the sum- of-products form

Answer 14

ANDed variables are ORed together .

Question 15

In the product-of-sums form

Answer 15

ORed variables are ANDed together

Question 16

An interconnection of logic gates

Answer 16

Logic diagrams