IB Computer Science Year 1 Standard Level - August 28 2017 Lesson Notes: Difference between revisions
Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||
Line 52: | Line 52: | ||
These standards are commonly used from the IB Computer Science Subject Guide<ref>IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.</ref> | These standards are commonly used from the IB Computer Science Subject Guide<ref>IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.</ref> | ||
* 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. | |||
Revision as of 15:10, 26 August 2017
What are we going to learn today?[edit]Hello Class! Today in class we will:
|
What is our homework?[edit]To review our learning please watch and reflect on these two videos:
To prepare for our next class, please watch and reflect on the video below: |
|
How am I being assessed today?[edit]
|
||
Standards we are covering today[edit]These standards are commonly used from the IB Computer Science Subject Guide[1]
|
As a computer scientist, you have:[edit]
|
|
Credits[edit] |
- ↑ IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.