CPS 1 - Spring, 2000 - Ramm 3/27/00 #27
- Announce
- Continue to Read Chap 7, Electric Circuits
- Quiz Wednesday
Chapter 6. Electric Circuits
- Logic/Truth Tables
- and: z = x and y
| x | y | | z
|
|---|
| 0 | 0 | | 0
|
| 0 | 1 | | 0
|
| 1 | 0 | | 0
|
| 1 | 1 | | 1
|
- or: z = x or y
| x | y | | z
|
|---|
| 0 | 0 | | 0
|
| 0 | 1 | | 1
|
| 1 | 0 | | 1
|
| 1 | 1 | | 1
|
- not: z = not x
- Implementing Logic with Switches
- Logical (Boolean) Expression
- Equivalence of:
- Circuit with Switches
- Truth Tables
- Boolean Expression
- Example: Truth table for f(x,y,z)
- f(x, y, z)
| x | y | z | | f
|
|---|
| 0 | 0 | 0 | | 0
|
| 0 | 0 | 1 | | 1
|
| 0 | 1 | 0 | | 1
|
| 0 | 1 | 1 | | 0
|
| 1 | 0 | 0 | | 1
|
| 1 | 0 | 1 | | 0
|
| 1 | 1 | 0 | | 0
|
| 1 | 1 | 1 | | 0
|
- F = X'*Y'*Z + X'*Y*Z' + X*Y'*Z'
- Relays
- Storing Information: Latch
- Binary Numbers
- Counting
| Binary | | Dec
|
|---|
| 8 | 4 | 2 | 1 | | 10 | 1
|
|---|
| 0 | 0 | 0 | 0 | | 0 | 0
|
| 0 | 0 | 0 | 1 | | 0 | 1
|
| 0 | 0 | 1 | 0 | | 0 | 2
|
| 0 | 0 | 1 | 1 | | 0 | 3
|
| 0 | 1 | 0 | 0 | | 0 | 4
|
| 0 | 1 | 0 | 1 | | 0 | 5
|
| 0 | 1 | 1 | 0 | | 0 | 6
|
| 0 | 1 | 1 | 1 | | 0 | 7
|
| 1 | 0 | 0 | 0 | | 0 | 8
|
| 1 | 0 | 0 | 1 | | 0 | 9
|
| 1 | 0 | 1 | 0 | | 1 | 0
|
| 1 | 0 | 1 | 1 | | 1 | 1
|
| 1 | 1 | 0 | 0 | | 1 | 2
|
| 1 | 1 | 0 | 1 | | 1 | 3
|
| 1 | 1 | 1 | 0 | | 1 | 4
|
| 1 | 1 | 1 | 1 | | 1 | 5
|
- Conversion to and from Decimal
- Binary Addition
- Sum Truth Table
| X | Y | Ci | | S
|
|---|
| 0 | 0 | 0 | | 0
|
| 0 | 0 | 1 | | 1
|
| 0 | 1 | 0 | | 1
|
| 0 | 1 | 1 | | 0
|
| 1 | 0 | 0 | | 1
|
| 1 | 0 | 1 | | 0
|
| 1 | 1 | 0 | | 0
|
| 1 | 1 | 1 | | 1
|
- Carry Truth Table
| X | Y | Ci | | C
|
|---|
| 0 | 0 | 0 | | 0
|
| 0 | 0 | 1 | | 0
|
| 0 | 1 | 0 | | 0
|
| 0 | 1 | 1 | | 1
|
| 1 | 0 | 0 | | 0
|
| 1 | 0 | 1 | | 1
|
| 1 | 1 | 0 | | 1
|
| 1 | 1 | 1 | | 1
|
- add.gif,
add.ps
