From Computer Science Wiki
|
|
| Line 8: |
Line 8: |
| # Construct truth tables using the above operators. | | # Construct truth tables using the above operators. |
| # Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. | | # Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates. |
|
| |
| # If we have time, you will meet our textbook. | | # If we have time, you will meet our textbook. |
| </td> | | </td> |
Revision as of 15:37, 30 August 2016
 What are we going to learn today?[edit]
- Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
- Construct truth tables using the above operators.
- Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.
- If we have time, you will meet our textbook.
|
 Homework[edit]
- Please study the following pages:
- Application software
|
 How am I being assessed today?[edit]
- I will be using formative assessment today to ensure you understand our content.
|
 Standards we are covering today[edit]
- Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
- Construct truth tables using the above operators.
- Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.
- Click here for all our standards
|
 As a computer scientist, you have:[edit]
- Confidence in dealing with complexity
- Persistence in working with difficult problems
- Tolerance for ambiguity
- The ability to deal with open-ended problems
- The ability to communicate and work with others to achieve a common goal or solution
|
 Credits[edit]
|
