Week 8 Flashcards

1
Q

max gate delay

A

add max number of gates needed to reach output

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

replicate the adder multiple times

A

ripple carry adder

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

_____ circuits maintain the current state they are in

A

sequential

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

_____ is one of the most basic sequential circuits

A

latch

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

latch has an extra input called a _____

A

enable line

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

input is frozen when…

A

enable line is 0

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

propogation delay:

A

delay occurs between time input changes & output changes

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

flip flops:

A

depend on previous input
depend on current input
cannot be constructed from single gate, but rather pair of latches
changes output every “1” bit // only switches when input “rises”

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

identity circuit

A

2 NOT gates, output = 2 T input, where T = 1 gate delay

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

feedback

A

joining a circuit back to itself, output is connected to input

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

S’R’ latch

A

set or reset logic value of output

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

Remember (S’R’ table)

A

S’ = 1, R’ = 1, Q(t) = X, Q(t+1) = Q(t) (No change, quite literally remember the state Q(t) is in)

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

Set (S’R’ table)

A

S’ = 0, R’ = 1, Q(t) = X, Q(t+1) = 1 (Start remembering 1)

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

Reset (S’R’ table)

A

S’ = 1, R’ = 0, Q(t) = X, Q(t+1) = 0 (Start remembering 0)

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

(avoid) (S’R’ table)

A

S’ = 0, R’ = 0, Q(t) = X, Q(t+1) = Q’(t+1) = 1 (bad behavior)

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

combinatorial

A

function of logic outputs

17
Q

sequential:

A

function of current and historic logic outputs (time)

18
Q

What values of S’R’ do you need for…

Have: Q(t) = 1
Want: Q(t+1) = 1

A

S’ = X R’ = 1

Can be either Remember or Set, so S’ doesn’t matter as long as R’ is 1

19
Q

What values of S’R’ do you need for…

Have: Q(t) = 0
Want: Q(t+1) = 1

A

S’ = 0 R’ = 1

Set to 1

20
Q

What values of S’R’ do you need for…

Have: Q(t) = 1
Want: Q(t+1) = 0

A

S’ = 1 R’ = 0

Reset to 0

21
Q

What values of S’R’ do you need for…

Have: Q(t) = 0
Want: Q(t+1) = 0

A

S’ = 1, R’ = X

Can be either Remember or Reset, so R’ doesn’t matter as long as S’ is 1