DE Ch 5

studied byStudied by 0 people
0.0(0)
learn
LearnA personalized and smart learning plan
exam
Practice TestTake a test on your terms and definitions
spaced repetition
Spaced RepetitionScientifically backed study method
heart puzzle
Matching GameHow quick can you match all your cards?
flashcards
FlashcardsStudy terms and definitions
Get a hint
Hint

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

1 / 19

encourage image

There's no tags or description

Looks like no one added any tags here yet for you.

20 Terms

1

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

True

New cards
2

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

True

New cards
3

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

True

New cards
4

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

False

New cards
5

Most digital circuits require multiple gates

True

New cards
6

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

Synthesis

New cards
7

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

Boolean equation

New cards
8

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

Octet

New cards
9

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

Boolean inputs

New cards
10

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

true and complement variables

New cards
11

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

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

New cards
12

The inputs to a circuit has values from ________

0 to 3

New cards
13

Boolean functions are governed by:

an order of precedence

New cards
14

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

logic gate network

New cards
15

Which of the following is an example of a product term

A'C'

New cards
16

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

New cards
17

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

Maxterm

New cards
18

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

New cards
19

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

New cards
20

______________ 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

New cards
robot