Term
| What is a digital circuit? |
|
Definition
| a circuit with two logical values are present |
|
|
Term
| What are 2 logical values in a digital circuit? |
|
Definition
1) a signal between 0 and 0.5 volt
2) a signal between 1 and 1.5 volts |
|
|
Term
| What is the signal between 0 and 0.5 volt in binary? |
|
Definition
|
|
Term
| What is the signal between 1 and 1.5 volts in binary? |
|
Definition
|
|
Term
|
Definition
| Tiny electronic devices that can compute various functions of these 2-valued system. |
|
|
Term
| What is the name for below level 0? |
|
Definition
|
|
Term
| Where are the collector, the base, and the emitter? |
|
Definition
|
|
Term
| What are the 3 connectors in a transistor to the outside world? |
|
Definition
1) collector
2) base
3) emitter
|
|
|
Term
| What does V-in stand for? |
|
Definition
|
|
Term
| What does V-out stand for? |
|
Definition
|
|
Term
|
Definition
| an externally regulated voltage |
|
|
Term
| What happens when V-in is low? |
|
Definition
| The transistor turns off and acts like an infinite resistance so the output/V-out to take a value close to V-cc such as 1/5 volts. |
|
|
Term
| What happened when V-in is high? |
|
Definition
| The transistor switches on and acts like a wire causing V-out to be pull down to the ground (bottom line) at 0 volts. |
|
|
Term
|
Definition
When V-in is low, V-out is high
When V-in is high, V-out is low |
|
|
Term
| What is the jagged line in the top V-cc line? |
|
Definition
| The resistor which regulates the amount of current drawn so the transistor doesn't burn out. |
|
|
Term
| How long does the switch take for a circuit? |
|
Definition
|
|
Term
| What would happen if 2 transistors were cascaded in a series? |
|
Definition
If both V1 and V2 were high, both transistors would conduct and V-out would be pulled low.
V1 and V2 are the same as V-in.
If either V1 or V2 were low, the corresponding transitor would be off and output would be high.
Only grounded/low if both are high. |
|
|
Term
| What would happend if two transistors are wired parallel? |
|
Definition
If either input is high, transistor is on and it's grounded.
If both are low, transistor is high.
If both are high, transistor is high.
Only time low is if one is different.
|
|
|
Term
| What are the 3 simpliest gates? |
|
Definition
|
|
Term
| What are Not gates usually called? |
|
Definition
| Inverters because they invert the usual anwer. |
|
|
Term
|
Definition
|
|
Term
|
Definition
|
|
Term
| What does a NOT gate look like? |
|
Definition
|
|
Term
What does a NAND gate look like? |
|
Definition
|
|
Term
| What does a NOR gate look like? |
|
Definition
|
|
Term
| What does an AND gate look like? |
|
Definition
|
|
Term
| What does an OR gate look like? |
|
Definition
|
|
Term
| What is the truth table for a NOT gate? |
|
Definition
|
|
Term
| What is the truth table for a NAND gate? |
|
Definition
A B X
0 0 1
0 1 1
1 0 1
1 1 0 |
|
|
Term
| What is the truth table for the NOR gate? |
|
Definition
A B X
0 0 1
0 1 0
1 0 0
1 1 0 |
|
|
Term
| What is the truth table for the AND gate? |
|
Definition
A B X
0 0 0
0 1 0
1 0 0
1 1 1 |
|
|
Term
| What is the truth table for an OR gate? |
|
Definition
A B X
0 0 0
0 1 1
1 0 1
1 1 1 |
|
|
Term
| What is an inversion bubble? |
|
Definition
| The small circle on a gate (NOT/NAND/NOR) to mean opposite or inversion. |
|
|
Term
| How many transistors do the NAND and NOR gates require? |
|
Definition
|
|
Term
| How many transistors do the AND and OR gates require? |
|
Definition
|
|
Term
| Why do most computers use NAND and NOR gates? |
|
Definition
| They are simpler because they require only two gates. |
|
|
Term
| What are the 2 major technologies? |
|
Definition
|
|
Term
|
Definition
| Metal Oxide Semi-Conductor |
|
|
Term
| What are the 2 types of bipolar? |
|
Definition
|
|
Term
|
Definition
| Transistor-Transistor Logic |
|
|
Term
|
Definition
|
|
Term
| Which technology has taken over bipolar or MOS? |
|
Definition
|
|
Term
| Why is MOS better than TTL and ECL (both bipolar)? |
|
Definition
| even though they are slower they require much less power and take up less space |
|
|
Term
|
Definition
| variables and functions can only take on the values of 0 and 1 |
|
|
Term
| Who discovered Boolean Algebra? |
|
Definition
|
|
Term
| What is the other name for Boolean Algebra? |
|
Definition
|
|
Term
| What is a Boolean Function? |
|
Definition
| one or more input variables and yields output that depends on those variables |
|
|
Term
| What is the NOT function? |
|
Definition
| F(a) is 1 if A is 0 and f(a) is 0 if a is 1 |
|
|
Term
| How many possibly n variable combinations are there in a boolean function? |
|
Definition
|
|
Term
|
Definition
| a table with rows that telling the value of the function for different combinations of input values |
|
|
Term
| How do you list the rows of a truth table? |
|
Definition
In numerical order
00
01
10
11 |
|
|
Term
| 2 variables make how many boolean functions? |
|
Definition
|
|
Term
| The truth table of 3 variable |
|
Definition
A B C X
0 0 0 0
0 0 1 0
0 1 0 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1 |
|
|
Term
| What does the bar over a variable mean? |
|
Definition
|
|
Term
What happened during an AND function?
AB
|
|
Definition
|
|
Term
What happens during an OR function?
A+B |
|
Definition
|
|
Term
| What is the general method to implement a circuit? |
|
Definition
1) write down the truth table
2) provide inverters to generate the complement of each input
3) draw an AND gate for each term with a 1 in the result column
4) Wire and AND gates to the appropriate inputs
5) Feed the output of all the AND gates into an OR gate
|
|
|
Term
| Why are NAND and NOR gates said to be complete? |
|
Definition
| any Boolean function can be computed using either of them |
|
|
Term
| What are the AND and OR forms of Identity Law? |
|
Definition
|
|
Term
| What are the AND and OR forms of Null Law? |
|
Definition
|
|
Term
| What are the AND and OR forms of Idempotent law? |
|
Definition
|
|
