Chapter 3: Digital Logic Structures Flashcards

1
Q

MOS Transistors

A
(metal-oxide semiconductor)
Makes or breaks a closed circuit
Two-Types:
p-type
n-type
Both operate logically (i.e. like switches)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

3 Terminals of a MOS Transistor

A

gate
source
drain

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

n-type transistor
Closed circuit if _______
Open circuit if _______

A

Closed: some amount of voltage (i.e. 2.9 volts)
Open: 0 volts

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

p-type transistor
Closed circuit if _______
Open circuit if _______

A

Opposite (i.e. complementary) to n-type transistor
Closed: 0 volts
Open: some amount of voltage (i.e. 2.9 volts)

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

CMOS circuits

A

contain both n-type and p-type transistors

Complementary Metal-Oxide Semiconductor

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

NOT gate

A

aka “Inverter”

an electronic circuit that implements the NOT logic function.

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

NOR gate

A

an electronic circuit that implements the NOT-OR logic function.
(exactly the opposite of the OR function)

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

OR gate

A

an electronic circuit that implements the OR logic function.

achieved by adding an inverter (NOT gate) to a NOR gate.

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

AND gate

A

an electronic circuit that implements the AND logic function.
achieved by adding an inverter (NOT gate) to a NAND gate.

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

NAND gate

A

an electronic circuit that implements the NOT-AND logic function.

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

DeMorgan’s Law

A

“it is not the case that both A and B are false” is equivalent to “at least one of A and B is true”

(see paper note-card for symbolic representation)

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

An n-input AND gate has an output value of 1 only if ____ n input variables have values of __.

A

ALL

1

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

An n-input OR gate has an output value of 1 if ____ of the n input variables has a value of __.

A

ANY

1

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

An n-input OR gate has an output value of 0 only if ____ n input variables have values of __.

A

ALL

0

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

An n-input AND gate has an output value of 0 if ____ of the n input variables has a value of __.

A

ANY

0

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

Two kinds of logic structures:

A

1) store information

2) do not store information

17
Q

Decision Elements

A

aka: combinational logic structures
Logic structures that do not store information.
Outputs are strictly dependent on the combination of input values that are being applied to the structure right now.
Not at all dependent on any past history of information that is stored internally, since no info can be stored internally in this type of circuit.
(e.g. Decoder, Mux, Full Adder)

18
Q

Decoder

A

exactly one output is 1 and all the rest are 0s.

In general: has n inputs and 2^n outputs.

19
Q

In a Decoder, the output line that detects the the input pattern (i.e. the line that has an output of 1) is _______.

A

asserted

20
Q

Mux

A

two-input multiplexer
Function is to select one of the inputs and connect it to the output.
In general: consists of 2^n inputs and n select lines.

21
Q

The Select Signal in a Mux determines ________

A

which input is connected to the output.
i.e. if S = 0, that input is NOT connected to the output in the example on p.61., if S = 1 then that input IS connected to the output.

22
Q

Full Adder

A

A logic circuit that provides 3 inputs and 2 outputs

23
Q

Programmable Logic Array (PLA)

A

an array of AND gates followed by an array of OR gates.
The number of AND gates corresponds to the number of input combinations (rows) in the truth table.
The number of OR gates corresponds to the number of output columns.

24
Q

Logical Completeness

A

Any logic function can be accomplished as long as there are enough AND, OR, and NOT gates available.
(i.e. the set of gates {AND, OR, NOT} is logically complete because sufficient to build a logic circuit for any truth table)