Digital Logic Design 2 Flashcards

1
Q

Define Duality Principle

A

A valid algebraic expression can be derived from another by interchanging the operators and identity elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How do you find the dual?

A

Interchange · and + operators

Replace 1’s with 0’s and vice versa

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are the 6 basic theorems?

A

Theorem 1
x + x = x
x · x = x

Theorem 2
x + 1 = 1
x · 0 = 0

Theorem 3, involution
(x’)’ = x

Theorem 4, associative law
x + (y + z) = (x + y) + z
x(yz) = (xy)z

Theorem 5, DeMorgan’s theorem
(x + y)’ = x’ · y’
(x · y)’ = x’ + y’

Theorem 6, absorption
x + xy = x

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Using the numbers 1-4 (1 is highest) what is the precedence for boolean operators?

A
  1. ()
  2. NOT ‘
  3. AND ·
  4. OR +
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is a boolean function?

A
Are algebraic expressions formed with:
Binary variables
Binary operators OR (+) and AND (·)
Unary operator NOT ( ’)
parentheses
equal sign
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How can boolean functions be represented?

A

As a truth table

Boolean functions can be represented with a logic diagram composed of AND, OR, and NOT gates

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is algebraic minimization?

A

attempt to use postulates and theorems to reduce a boolean function down to its simplest representation (minimize literals and terms)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Define literal

A

A primed or unprimed variable

Each literal in a function corresponds to an input to a gate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Define term

A

A term consists of one or more literals grouped together with an AND or OR operator
Each term is implemented with a gate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Why is minimization important?

A

In designing logic, we often begin with a truth table
From this a boolean function is obtained
From this a hardware design is made

Thus when we minimize the function we minimize the hardware design, this in turn

Reduces cost
Reduces power consumption
Reduces package count
Increases speed 
Simplifies testing and debugging
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the complement of a function?

A

The complement of a function f is f’ (primed)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How can you find a complement of a function

A

for a truth table invert 0’s and 1

algebraically use DeMorgan’s Theorem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How do you find the complement of a function involving deMorgan’s Theorem?

A

Complement the entire expression

Apply DeMorgan’s theorem repeatedly

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the short cut method of DeMorgan’s Theorem?

A

Form the dual of the function

Complement each literal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly