Difference between revisions of "CSC231 Lab 3 (Digital Electronics)"
(→3-Bit Adder) |
|||
| Line 1: | Line 1: | ||
| + | © D. Thiebaut, 2010 | ||
| Line 9: | Line 10: | ||
<br /> | <br /> | ||
| − | |||
| − | |||
| − | + | ||
| + | =Data Sheets= | ||
If you need to refer to the data sheets of various chips during the lab, you can click on any of the links below: | If you need to refer to the data sheets of various chips during the lab, you can click on any of the links below: | ||
| Line 62: | Line 62: | ||
[http://cs.smith.edu/~thiebaut/classes/270/datasheets/CD74hct541.pdf 74HCT54]. | [http://cs.smith.edu/~thiebaut/classes/270/datasheets/CD74hct541.pdf 74HCT54]. | ||
| − | ==3-Bit Adder | + | =Preamble= |
| + | |||
| + | * Assume that we have two boolean variables, a and b. How could you prove that the following equality always hold? | ||
| + | |||
| + | a + a'. b = a + b | ||
| + | |||
| + | |||
| + | =3-Bit Adder= | ||
* Write down all 8 possible additions of 3 bits, and show the two bits that result: ''Carry'' and ''Sum'', in a manner similar to the example below | * Write down all 8 possible additions of 3 bits, and show the two bits that result: ''Carry'' and ''Sum'', in a manner similar to the example below | ||
| Line 90: | Line 97: | ||
</pre></code> | </pre></code> | ||
| − | |||
| + | * Generate the boolean expression for C and S. This steps will require the whole class to work together | ||
Revision as of 11:46, 16 September 2010
© D. Thiebaut, 2010
Back to the weekly schedule
Contents
Data Sheets
If you need to refer to the data sheets of various chips during the lab, you can click on any of the links below: If the datasheets haven't been printed yet, print a set from these links: 74LS00 74LS01 74LS02 74LS03 74LS04 74LS05 74LS08 74LS09 74LS10 74LS12 74LS13 74LS15 74LS20 74LS21 74LS22 74LS26 74LS27 74LS28 74LS30 74LS32 74LS33 74LS37 74LS38 74LS40 74LS42 74LS47 74LS48 74LS51 74LS54 74LS55 74LS74 74LS75 74LS76 74LS83 74LS85 74LS86 74LS90 74LS9 74LS13 74HCT24 74LS24 74HCT24 74LS25 74HCT54.
Preamble
- Assume that we have two boolean variables, a and b. How could you prove that the following equality always hold?
a + a'. b = a + b
3-Bit Adder
- Write down all 8 possible additions of 3 bits, and show the two bits that result: Carry and Sum, in a manner similar to the example below
0 + 0 + 0 ------ X X
- Fill out the truth table below where a, b, and d are the three bits that are added together, C is the carry, and S the sum.
a b d | C S
-----------+--------
0 0 0 |
0 0 1 |
0 1 0 |
0 1 1 |
1 0 0 |
1 0 1 |
1 1 0 |
1 1 1 |
- Generate the boolean expression for C and S. This steps will require the whole class to work together
