DE Ch 5

When grouping terms for simplification, every pair of terms must have at least one term that belongs to that pair.

True

The number of cells in a K-Map is always a power of 2, usually 4, 8, or 16

True

The more digital components or gates used inside a circuit, the more difficult it might be to simplify the circuit

True

In a K-map, a cell should never be grouped more than once

False

Most digital circuits require multiple gates

True

________ is the process of creating a logic circuit from a description such as a boolean equation or truth table

Synthesis

When designing a combinational logic circuit, you are ultimately looking for a:

Boolean equation

A(n) __________ is a group of eight adjacent cells

Octet

A combinational logic circuit is one in which two ore more gates are connected together to combine several:

Boolean inputs

There are two ways of labeling cell coordinates: 1. numerically or 2. by_____

true and complement variables

A yellow light, called the ALERT light, illuminates when:

Two ore more sensors indicate an out-of-range condition

The inputs to a circuit has values from ________

0 to 3

Boolean functions are governed by:

an order of precedence

When two or more gates are connected together, they form a

logic gate network

Which of the following is an example of a product term

A'C'

One way to simplify a ____ is to look for pairs of product terms that are different by just one variable, then factor out what is common to the term, as you would do in other types of algebra

sum-of-products

______is a sum term in a boolean expression where all possible variables appear once in true or complement form

Maxterm

A ______ is a variable around the edge of a K-map that represents an input variable (e.g. A, B, C, or D) for the boolean expression to be simplified

Cell coordinate

The maximum simplification of a boolean expression is achieved only if the circled groups of cells in its K-map are ________ and there are as few groups as possible

as large as possible

______________ is the practice of drawing gates in a logic diagram so that inverting outputs connect to inverting inputs and noninverting outputs connect to noninverting inputs.

Bubble to bubble convention