IB Comp Sci SL - August 31 2016 Lesson Notes: Difference between revisions

From Computer Science Wiki
No edit summary
 
(4 intermediate revisions by the same user not shown)
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 sign up for our google classroom site
# 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.
# 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>
Line 17: Line 18:


# Please study the following pages:
# Please study the following pages:
## [[Application software]]
* [[Boolean operators]]
* [[Truth tables]]
* [[Logic diagram]]


</td>
</td>
Line 69: Line 72:
</tr>
</tr>
</table>
</table>
[[Category:Class Notes]]
[[Category:2016-2017 Class Notes]]
[[Category:2016-2017 School Year]]
[[Category:2016-2017 School Year]]

Latest revision as of 08:22, 31 August 2016

Class plan.png What are we going to learn today?[edit]

  1. We will sign up for our google classroom site
  2. We will construct an understanding of logic operators using this site
  3. Define the Boolean operators: AND, OR, NOT, NAND, NOR and XOR.
  4. Construct truth tables using the above operators.
  5. Construct a logic diagram using AND, OR, NOT, NAND, NOR and XOR gates.
  6. If we have time, you will meet our textbook.

Homework.png Homework[edit]

  1. Please study the following pages:

Target.png How am I being assessed today?[edit]

  1. I will be using formative assessment today to ensure you understand our content.

Ourstandards.png 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



Computer1.png 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

Credit.png Credits[edit]