✒️
Computer Science Principles
  • Introduction
  • Overview
  • Course at a Glance
  • Course Exam Description
  • Create Performance Task
  • Reference Sheet
  • Resources
  • Big Idea 1
    • 1.1 Collaboration
    • 1.2 Program Function and Purpose
    • 1.3 Program Design and Development
    • 1.4 Identifying and Correcting Errors
  • Big Idea 2
    • 2.1 Binary Numbers
    • 2.2 Data Compression
    • 2.3 Extracting Information from Data
    • 2.4 Using Programs with Data
  • Big Idea 3
    • 3.1 Variables and Assignments
    • 3.2 Data Abstraction
    • 3.3 Mathematical Expressions
    • 3.4 Strings
    • 3.5 Boolean Expression
    • 3.6 Conditionals
    • 3.7 Nested Conditionals
    • 3.8 Iteration
    • 3.9 Developing Algorithms
    • 3.10 Lists
    • 3.11 Binary Search
    • 3.12 Calling Procedures
    • 3.13 Developing Procedures
    • 3.14 Libraries
    • 3.15 Random Values
    • 3.16 Simulations
    • 3.17 Algorithmic Efficiency
    • 3.18 Undecidable Problems
  • Big Idea 4
    • 4.1 The Internet
    • 4.2 Fault Tolerant
    • 4.3 Parallel and Distributed Computing
  • Big Idea 5
    • 5.1 Beneficial and Harmful Effects
    • 5.2 Digital Divide
    • 5.3 Computing Bias
    • 5.4 Crowdsourcing
    • 5.5 Legal and Ethical Concerns
    • 5.6 Safe Computing
  • Code
    • Week 10
    • Week 11
    • Week 12
    • Week 13
    • Week 14
    • Week 15
    • Week 16
    • Week 17
    • Week 18
    • Week 19
    • Week 20
    • Week 21
    • Week 22
Powered by GitBook
On this page
  • Enduring Understanding
  • Learning Objective
  • Essential Knowledge
  • Learning Objective
  • Essential Knowledge

Was this helpful?

Export as PDF
  1. Big Idea 3

3.5 Boolean Expression

Enduring Understanding

The way statements are sequenced and combined in a program determines the computed result. Programs incorporate iteration and selection constructs to represent repetition and make decisions to handle varied input values.

Learning Objective

For relationships between two variables, expressions, or values:

a. Write expressions using relational operators.

b. Evaluate expressions that use relational operators.

Essential Knowledge

A Boolean value is either true or false.

The exam reference sheet provides the following relational operators: =, ≠, >, <, ≥, and ≤.

Text and Block:

  • a = b

  • a ≠ b

  • a > b

  • a < b

  • a ≥ b

  • a ≤ b

These are used to test the relationship between two variables, expressions, or values. A comparison using a relational operator evaluates to a Boolean value. For example, a = b evaluates to true if a and b are equal; otherwise, it evaluates to false.

Learning Objective

For relationships between Boolean values:

a. Write expressions using logical operators.

b. Evaluate expressions that use logical operators.

Essential Knowledge

The exam reference sheet provides the logical operators NOT, AND, and OR, which evaluate to a Boolean value.

The exam reference sheet provides

Text:

NOT condition

Block:

which evaluates to true if condition is false; otherwise it evaluates to false.

The exam reference sheet provides

Text:

condition1 AND condition2

Block:

which evaluates to true if both condition1 and condition2 are true; otherwise it evaluates to false.

The exam reference sheet provides

Text:

condition1 OR condition2

Block:

which evaluates to true if condition1 is true or if condition2 is true or if both condition1 and condition2 are true; otherwise it evaluates to false.

The operand for a logical operator is either a Boolean expression or a single Boolean value.

Previous3.4 StringsNext3.6 Conditionals

Last updated 1 year ago

Was this helpful?