2.3 2.4 Combinatorial Logic Flashcards

1
Q

What is the decomposition design pattern

A

Separate function for each output bit

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

What is the sharing design pattern

A

If value used twice, only compute it once and share value.

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

What is the isolated replication design pattern (2-input 1-bit to 2-input m-bit AND gate)

A

Replication of gates

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

What is the cascaded replication design pattern (2-input 1-bit to n-input 1-bit AND)

A

Cascade ANDs together

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

What is the algorithm for computing a Karnough map expression

A
  • OR true conditions together (DNF)
  • 2^i groups
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the difference between a multiplexer and demultiplexer

A

Mux: choose between input signals
Demux: choose between output wires (to send input)

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

What is the multiplexer circuit diagram (and truth table)

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

What is the demultiplexer circuit diagram (and truth table)

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

How can you chain multiplexers via isolated replication (ie propagate entire word)

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

How can you chain multiplexers via cascaded replication (ie multiple decision points)

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

What is the difference between a half and full adder

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

What is a half adder circuit diagram

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

What is the full adder circuit diagram

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

What is the n-bit addition circuit (FA)

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

What are the 2 essential comparison operators

A
  • EQ, LESS THAN
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the equality comparitor circuit and truth table (1-bit)

A
17
Q

What is the less than comparator circuit and truth table (1 bit)

A
18
Q

What is the n-bit equality circuit

A
  • Cascaded replication
19
Q

What is the n-bit less than comp circuit

A