Please enable JavaScript to use CodeHS

AP Computer Science A (Nitro)

View Syllabus Overview
Boolean Expressions and if Statements
Description

In this lesson, students will learn about Boolean expressions and relational operators. Relational Operators are constructs in programming that allow for the comparison of the values of two expressions. This lesson corresponds with AP Computer Science A topic 3.1.

Objective

Students will be able to:

  • Evaluate Boolean expressions that use relational operators in program code
Description

In this lesson, students will learn about control structures and if statements. If statements are used in programming when there are a set of statements that should be executed only when certain conditions are met. This lesson corresponds with AP Computer Science A topic 3.2.

Objective

Students will be able to:

  • Represent branching logical processes by using flowcharts
  • Use if statements
Description

In this lesson, students will expand their knowledge of control structures and learn about if/else statements. This lesson corresponds with AP Computer Science A topic 3.3.

Objective

Students will be able to:

  • Use if/else statements
Description

In this lesson, students will take control structures a step further and learn how to implement a statement with an else if condition. This lesson corresponds with AP Computer Science A topic 3.4.

Objective

Students will be able to:

  • Use an else if statement

Enduring Understandings

This lesson builds toward the following Enduring Understandings (EUs) and Learning Objectives (LOs). Students should understand that…

  • EU Con-1 The way variables and operators are sequenced and combined in an expression determines the computed result. (LO’s 1.E)
  • EU Con-2 Programmers incorporate iteration and selection into code as a way of providing instructions for the computer to process each of the many possible input values. (LO’s 2.A)
Description

In this lesson, students will determine the truth value of compound Boolean expressions. They will also examine short circuit evaluation and nested if statements. This lesson corresponds with AP Computer Science A topic 3.5.

Objective

Students will be able to:

  • Evaluate compound Boolean expressions in program code
Description

In this lesson, students will examine De Morgan’s laws and determine when compound Boolean expressions are equivalent. They will use truth tables to display equivalent Boolean expressions. This lesson corresponds with AP Computer Science A topic 3.6.

Objective

Students will be able to:

  • Compare and contrast equivalent Boolean expressions
  • Apply De Morgan’s Laws to Boolean expressions
Description

In this lesson, students will learn the different ways of comparing objects and how it is different than comparing primitive types. With objects, because the variable is pointing to a location, the use of == is not possible, as the memory address is being compared between objects, not the actual values. Students will discover and use the .equals method. This lesson corresponds with AP Computer Science A topic 3.7.

Objective

Students will be able to:

  • Compare object references using Boolean expressions in program code

1.8 Boolean Expressions and if Statements Quiz