Skip to product information
1 of 3

Goldie's Math Emporium

Goldie's AP® Computer Science A UNIT 3 PLANS - If Statements

Goldie's AP® Computer Science A UNIT 3 PLANS - If Statements

Regular price $25.00 USD
Regular price Sale price $25.00 USD
Sale Sold out

AP® Computer Science A

Unit 3 – Boolean Expressions and if Statements

Welcome! If you are reading this, you are interested in getting some AMAZING resources for your AP® Computer Science A classroom. This class is an introductory course in the Java programming language.

If you are interested in a WHOLE YEAR of AP CSA, already planned and created for you, check out my full AP Computer Science A Curriculum!

This product is a .zip folder with the following items (you can click on the link to be taken to the individual product named):

Extra Unit 3 Materials:

  • Jeopardy® Review Game
  • Unit 3 In Class Review

All of the items are given in both .docx (Microsoft® Word) and .pdf format for your convince! Once purchased, you can clip, edit, and modify to suit your own classroom's needs.

I teach this course without a textbook, so everything that is provided here, can be used without supplementation. The only thing I use in my class that is NOT included in this content is the secured AP exam questions.

******************************************************************************

AP CSA Standards:

The following AP® CSA CED Standards are covered in each lesson in the unit.

Lesson 1: Simple ifs

  • CON-1.E Evaluate Boolean expressions that use relational operators in program code.
  • CON-2.A Represent branching logical processes by using conditional statements.

Lesson 2: Else

  • CON-2.A Represent branching logical processes by using conditional statements.
  • CON-2.B Represent branching logical processes by using nested conditional statements.

Lesson 3: Booleans and Truth Tables

  • CON-1.F Evaluate compound Boolean expressions in program code.
  • CON-1.G Compare and contrast equivalent Boolean expressions.

Lesson 4: Short Circuit Evaluation

  • CON-1.G Compare and contrast equivalent Boolean expressions.

Lesson 5: DeMorgan's Law

  • CON-1.G Compare and contrast equivalent Boolean expressions.

Lesson 6: Comparing Objects

  • CON-1.H Compare object references using Boolean expressions in program code.

You might also be interested in the following items:

******************************************************************************

If you need extra explanations or additional guidance, I would love to help!!

AP® is a registered trademark of the College Board® which does not endorse this product.

I want to provide the best possible resources to help other teachers out! You will be notified of any future updates and additions to this product and it will be free of charge. Your support is important and I thank you for allowing me to continue doing what I love to do.

© Goldie’s Math Emporium, LLC

This work is bound by copyright laws and editing (beyond your own classroom use), selling, redistributing, or posting all or part of these documents on the Internet is strictly prohibited. Violations are subject to the Digital Millennium Copyright Act.

View full details