ALEX Classroom Resource

  

Computer Science Discoveries Unit 3 Chapter 1 Lesson 11: Conditionals (18-19)

  Classroom Resource Information  

Title:

Computer Science Discoveries Unit 3 Chapter 1 Lesson 11: Conditionals (18-19)

URL:

https://studio.code.org/s/csd3-2018/stage/11/puzzle/1

Content Source:

Code.org
Type: Lesson/Unit Plan

Overview:

The class starts by using Booleans to compare the current value of a sprite property with a target value, using that comparison to determine when a sprite has reached a point on the screen, grown to a given size, or otherwise reached a value using the counter pattern. After using Booleans directly to investigate the values or sprite properties, the class adds conditional if statements to write code that responds to those Boolean comparisons.

Note: You will need to create a free account on code.org before you can view this resource.

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, comparison operators, conditionals, consolelog, counter, expression, flowchart, Ifstatement, sprite, target, value
License Type: Custom Permission Type
See Terms: https://code.org/tos
For full descriptions of license types and a guide to usage, visit :
https://creativecommons.org/licenses
Accessibility
Comments
  This resource provided by:  
Author: Aimee Bates