Brainscape's Knowledge GenomeTM


Top Flashcards (Certified)
All Flashcards

Circuit Design (EIU Spring 2023) > Chapter 2: Combinational Logic Circuits > Flashcards

Chapter 2: Combinational Logic Circuits Flashcards

1
Q

What are the three basic logical operations?

A

AND, OR, and NOT

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

By what is AND represented in Boolean Algebra?

A

By a dot (or the absence of an operator between variables)

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

By what is OR represented in Boolean Algebra?

A

+

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

By what is NOT represented in Boolean Algebra?

A

By a bar over the variable

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

When is X AND Y true (or 1)?

A

Only when both, X = 1 and Y = 1

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

When is X OR Y true (or 1)?

A

When X = 1 or when Y = 1 or when both are 1

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

When is NOT X true (or 1)?

A

When X = 0

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

How much Volt does the Apple M2 chip represent as a bit of 1?

A

1.1V

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

What are logic gates?

A

Electronic circuits that operate on one or more input signals to produce an output signal

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

What’s the electronic symbol for an AND gate?

A

IMAGE

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

What’s the electronic symbol for an OR gate?

A

IMAGE

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

What’s the electronic symbol for a NOT gate?

A

IMAGE

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

What’s another name given to a NOT gate?

A

Inverter

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

What is a gate delay?

A

It is the length of time it takes for an input change to result in the corresponding output change

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

What does NAND represent?

A

The complement of the AND operation (NOT-AND)

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

What does NOR represent?

A

The complement of the OR operation (NOT-OR)

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

When is X NAND Y true (or 1)?

A

When any of the following cases are true:
1) X = 0 and Y = 0
2) X = 0 and Y = 1
3) X = 1 and Y = 0

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

When is X NOR Y true (or 1)?

A

Only when X = 0 and Y = 0

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

What is XOR?

A

The exclusive-OR, which excludes the combination with both X and Y equal to 1

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

What is XNOR?

A

The complement of the XOR

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

Why is the XOR also called the odd function?

A

Because the output of XOR is true (or 1) when the number of true (or 1) inputs is odd

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

What is Boolean algebra?

A

An algebra dealing with binary variables and logic operations

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

In Boolean algebra, what is X + 0?

A

X

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

In Boolean algebra, what is X * 1?

A

X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
In Boolean algebra, what is X + 1?
1
26
In Boolean algebra, what is X * 0?
0
27
In Boolean algebra, what is X + X?
X
28
In Boolean algebra, what is X * X?
X
29
In Boolean algebra, what is X + NOT(X)?
1
30
In Boolean algebra, what is X * NOT(X)?
0
31
In Boolean algebra, what is NOT(NOT(X))?
X
32
In Boolean algebra, what are the commutative laws?
1) X + Y = Y + X 2) XY = YX
33
In Boolean algebra, what are the associative laws?
1) X + (Y + Z) = (X + Y) + Z = X + Y + Z 2) X(YZ) = (XY)Z = XYZ
34
In Boolean algebra, what are the distributive laws?
1) X(Y + Z) = XY + XZ 2) X + YZ = (X + Y)(X + Z)
35
In Boolean algebra, what are DeMorgan's laws?
1) NOT(X + Y) = NOT(X) * NOT(Y) 2) NOT(X * Y) = NOT(X) + NOT(Y)
36
What are the four main reasons of simplifying digital circuits?
1) Faster operations 2) Less costs 3) Lower gate delay 4) Less power consumption
37
Simplify X + XY to one literal
X
38
Simplify XY + X*NOT(Y) to one literal
X
39
Simplify X + NOT(X)*Y to two literals
X + Y
40
Simplify X(X + Y) to one literal
X
41
Simplify (X + Y)(X + NOT(Y)) to one literal
X
42
Simplify X * (NOT(X) + Y) to two literals
XY
43
What is the Consensus theorem?
XY + NOT(X)*Z + YZ = XY + NOT(X) * Z
44
What is the dual of a Boolean expression?
It is simply the same expression just that * is replaced with + and + is replaced with *
45
What is the complement of a Boolean function?
It is the NOT of the function or the function inverted
46
What is a simple method of obtaining the complement of a Boolean function?
Take the dual of the function and complement each literal
47
What are standard forms of Boolean functions?
It is a specific way of writing Boolean expressions to simplify them
48
What is a minterm?
A product term in which all the variables appear exactly once, either complemented or uncomplemented
49
What does a minterm represent?
It represents exactly one combination of binary variable values in the truth table, where the value of the Boolean function is 1 for that combination and 0 for all others
50
What is a maxterm?
A sum term that contains all the variables exactly once, either in complemented or uncomplemented form
51
The value of a max term represents what?
The value of a maxterm is 0 for the corresponding combination and 1 for all other combinations
52
How can a Boolean function be represented algebraically using minterms?
It can be represented by forming the logical sum of all the minterms that produce a 1 in the function
53
What is sum-of-product form?
A logical sum of products (or minterms)
54
What is a two-level implementation (or two-level circuit)?
It is a circuit with two levels of logic gates (f.ex. sum-of-products or product-of-sums)
55
If you can describe your circuit as a sum of products or a product of sums you can always design what kind of circuit?
A two-level implementation or two-level circuit
56
Why do we prefer two-level circuits over three-level circuits?
Because it is faster as it has two times the gate delay while three-level circuits have 3 times the gate delay
57
What is product-of-sum form?
A logical product of sums (or maxterms)
58
What is the map method of optimizing Boolean functions called?
Karnaugh map (K-map)
59
What does each square in a K-map represent?
One row of the truth table
60
The number of squares in each K-map is equal to the number of what in the corresponding function?
Minterms
61
Given two variables X and Y, how many squares does our K-map need?
4
62
What binary code is used to describe the squares when using K-maps?
Gray code
63
When drawing largest rectangles in a K-map what is the restriction?
The rectangles are constricted to contain numbers of squares that are powers of 2 (ie. 1, 2, 4, 8, 16, ...)
64
What is the main goal while using K-maps?
To find the fewest (largest) rectangles that include or cover all of the squares marked with 1s
65
How many squares does a three-variable K-map need?
8
66
How many squares does a four-variable K-map need?
16
67
What are prime implicants?
A group of squares or rectangles made up of bunch of adjacent minterms (i.e. all possible (largest!!) groups formed in the K-map)
68
What are essential prime implicants?
Groups that cover at least one minterm (or square) in the K-map that cannot be covered by any other prime implicant
69
What is the special property of essential prime implicants?
In the simplified expression the essential prime implicants have to occur, there is no way to leave them out
70
What are the two cases in which don't-care conditions occur?
1) The input combinations never occur 2) They occur, but we do not care what the outputs are in response to these combinations
71
What are don't-care conditions?
The unspecified minterms of a function
72
How do we denote don't-care conditions in the K-map?
With an X
73
What is the symbol of the XOR?
An encircled plus sign
74
What is X XOR Y equivalent to?
X XOR Y = X * NOT(Y) + NOT(X) * Y
75
What is propagation delay?
The time required for a change in value of a signal to propagate from input to output of a logic gate
76
The operating speed of a circuit is in what way related to the longest propagation delay through the gates of the circuit?
Inversely
77
What is the high-to-low propagation time?
The time it takes for a change from 0 to 1 at the input to be shown at the output
78
What is the low-to-high propagation time?
The time it takes for a change from 1 to 0 at the input to be shown at the output

Circuit Design (EIU Spring 2023) (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions