From Computer Science Wiki
|
|
Line 5: |
Line 5: |
| ==[[File:class_plan.png]] What are we going to learn today?== | | ==[[File:class_plan.png]] What are we going to learn today?== |
|
| |
|
| | # We will construct an understanding of logic operators [http://www.neuroproductions.be/logic-lab/ using this site] |
| # Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. | | # Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR. |
| # Construct truth tables using the above operators. | | # Construct truth tables using the above operators. |
Revision as of 08:43, 31 August 2016
What are we going to learn today?[edit]
- We will construct an understanding of logic operators using this site
- 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:
|
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]
|