ALEX Classroom Resource

  

Boolean Logic & Logic Gates: Crash Course Computer Science #3

  Classroom Resource Information  

Title:

 Boolean Logic & Logic Gates: Crash Course Computer Science #3

URL:

 https://aptv.pbslearningmedia.org/resource/boolean-logic-crash-course-cs/boolean-logic-crash-course-cs/

Content Source:

 PBS
Type: Audio/Video

Overview:

Today, Carrie Anne is going to take a look at how those transistors we talked about during the last episode can be used to perform complex actions. With just two states, on and off, the flow of electricity can be used to perform a number of logical operations, which are guided by a branch of mathematics called Boolean Algebra. We’re going to focus on three fundamental operations - NOT, AND, and OR - and show how they were created in a series of really useful circuits. These simple electrical circuits lay the groundwork for our much more complex machines.

Content Standard(s):
Digital Literacy and Computer Science
DLIT (2018)
Grade: 6
5) Identify algorithms that make use of sequencing, selection or iteration.

Examples: Sequencing is doing steps in order (put on socks, put on shoes, tie laces); selection uses a Boolean condition to determine which of two parts of an algorithm are used (hair is dirty? True, wash hair; false, do not); iteration is the repetition of part of an algorithm until a condition is met (if you're happy and you know it clap your hands, when you're no longer happy you stop clapping).

Unpacked Content
Evidence Of Student Attainment:
Students will:
  • find algorithms that demonstrate the three basic programming structures.
Teacher Vocabulary:
algorithm sequence selection iteration
Knowledge:
Students know:
  • differences between the three basic programming structures.
Skills:
Students are able to:
  • explain the differences in sequencing, selection, and iteration.
Understanding:
Students understand that:
  • differences exist in sequencing, selection, and iteration.
Digital Literacy and Computer Science
DLIT (2018)
Grade: 7
2) Create complex pseudocode using conditionals and Boolean statements.

Example: Automated vacuum pseudocode — drive forward until the unit encounters an obstacle; reverse 2"; rotate 30 degrees to the left, repeat.

Unpacked Content
Evidence Of Student Attainment:
Students will:
  • compile a set of complex steps that contain conditional operators to include if, then, else and Boolean statements such as >, <, =,.
Teacher Vocabulary:
  • pseudocode
  • conditional
  • Boolean statement
Knowledge:
Students know:
  • that Boolean logic combined with conditional statements make for complex and powerful programs.
Skills:
Students are able to:
  • use Boolean logic combined with conditional statements to create complex pseudocode or a program.
Understanding:
Students understand that:
  • questions in conditionals are what makes programs more complex.
Tags: Boolean, circuit, computing, logic, technology
License Type: Custom Permission Type
See Terms: https://www.pbslearningmedia.org/help/terms-of-use/
For full descriptions of license types and a guide to usage, visit :
https://creativecommons.org/licenses
AccessibilityVideo resources: includes closed captioning or subtitles
Comments
  This resource provided by:  
Author: Stephanie Carver
This site may contain links to other websites or content belonging to or originating from third parties or links to websites and features in banners or other advertising. Such external links are not investigated, monitored, or checked for accuracy, adequacy, validity, reliability, availability, or completeness by us. WE DO NOT WARRANT, ENDORSE, GUARANTEE, OR ASSUME RESPONSIBILITY FOR THE ACCURACY OR RELIABILITY OF ANY INFORMATION OFFERED BY THIRD-PARTY WEBSITES LINKED THROUGH THIS SITE.
Copyright © 2017, Alabama Learning Exchange
Alabama State Department of Education
Alabama State Department of Education