Goldie's AP® Computer Science A UNIT 4 PLANS - Iteration

AP® Computer Science A

Unit 4 – Iteration

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):

• Student guided notes, Teacher PowerPoint Slides, and Content Videos
• 5 homework problem sets & complete test review (answer keys included)
• 2 assessments: quiz and test (annotated answer keys included)
• 4 projects (answer keys included)
• Pacing and learning objectives

Extra Unit 4 Materials:

• Unit 4 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: While Loops

• CON-2.C Represent iterative processes using a while loop.

Lesson 2: Algorithms with While Loops

• CON-2.D For algorithms in the context of a particular specification that does not require the use of traversals: a. Identify standard algorithms. b. Modify standard algorithms. c. Develop an algorithm.

Lesson 3: for Loops

• CON-2.E Represent iterative processes using a for loop.

 Lesson 4: Algorithms for Strings

• CON-2.F For algorithms in the context of a particular specification that involves String objects: a. Identify standard algorithms. b. Modify standard algorithms. c. Develop an algorithm

Lesson 5: Nested Loops

• CON-2.G Represent nested iterative processes.
• CON-2.H Compute statement execution counts and informal run-time comparison of iterative statements.

You might also be interested in the following items:

• AP CSA Guided Notes Bundle
• AP CSA Coding Assignments Bundle
• AP CSA Homework Bundle
• AP CSA Assessment Bundle

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

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.