1. Rise and rise again until lambs become lions 授課老師：伍紹勳 課程助教：邱麟凱、江長庭 有情助教：蔡東倫

2. Rise and rise again until lambs become lions Outlines Familiar how to put theory into practice NAND – Boolean algebra representation of NAND – Truth table of NAND XOR – Boolean algebra representation of XOR – Truth table of XOR LAB 2 – Implement XOR by NAND gate

3. Rise and rise again until lambs become lions Experiment materials Bread board Power supply IC:7400*2 Light-emitting diode (LED)*2

4. Rise and rise again until lambs become lions Boolean algebra representation of NAND – Y= (AB)’ Truth table of NAND NAND Gate (7400 IC) Input AInput BOutput Y 001 011 101 110

5. Rise and rise again until lambs become lions XOR Boolean algebra representation of XOR – Y = A ⊕ B = AB’+A’B (sum of product) Truth table of XOR Input AInput BOutput Y 000 011 101 110

6. Rise and rise again until lambs become lions XOR

7. Rise and rise again until lambs become lions LAB 2 Implement XOR by NAND gate – Y = A ⊕ B = AB’+A’B Most of all digital circuits can be implemented by NAND gates – NOT gate: A’ = (AA)’ – AND gate: AB = ( (AB)’ )’ – OR gate: A+B = ( (A’)(B’) )’ (De Morgan's law) – Combinational logic: AB+CD = ( (AB)’(CD)’ )’

8. Rise and rise again until lambs become lions LAB 2 Implement XOR by NAND gate – Y = A ⊕ B = AB’+A’B