Skip to product information
1 of 3

Goldie's Math Emporium

Goldie's Unit 7 GUIDED NOTES for AP® Computer Science A

Goldie's Unit 7 GUIDED NOTES for AP® Computer Science A

Regular price $9.00 USD
Regular price Sale price $9.00 USD
Sale Sold out

AP® Computer Science A

Unit 7 – ArrayList

Guided Notes

These are the guided notes that I use in my classroom to teach the concepts of AP Computer Science A (using the Java programming language). This .zip folder contains:

  • The Word version of the student guided notes
  • The PowerPoints of the guided notes (answers included)
  • The PDF version of the guided notes
  • The PDF of the answer key for the student guided notes
  • VIDEO links to me teaching each lesson (free on YouTube)

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

 AP CSA Standards:

The following AP® CSA CED Standards are covered in each lesson. Note that the material is cumulative, so the standard is just the focus but it uses past information as well.

Lesson 1: Introduction to ArrayList

  • VAR-2.D Represent collections of related object reference data using ArrayList objects

Lesson 2: ArrayLists Methods

  • VAR-2.D Represent collections of related object reference data using ArrayList objects

Lesson 3: Traversing ArrayLists

  • VAR-2.E For ArrayList objects: a. Traverse using a for or while loop b. Traverse using an enhanced for loop

Lesson 4: Developing Algorithms Using ArrayList

  • CON-2.J For algorithms in the context of a particular specification that requires the use of ArrayList traversals: a. Identify standard algorithms. b. Modify standard algorithms. c. Develop an algorithm.

Lesson 5: Searching Arrays and ArraLists

  • CON-2.K Apply sequential/linear search algorithms to search for specific information in array or ArrayList objects.
  • CON-2.M Compute statement execution counts and informal run-time comparison of sorting algorithms.

Lesson 6: Selection Sort

  • CON-2.L Apply selection sort and insertion sort algorithms to sort the elements of array or ArrayList objects.
  • CON-2.M Compute statement execution counts and informal run-time comparison of sorting algorithms.

Lesson 7: Insertion Sort

  • CON-2.L Apply selection sort and insertion sort algorithms to sort the elements of array or ArrayList objects.
  • CON-2.M Compute statement execution counts and informal run-time comparison of sorting algorithms.

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