30–40% of the AP exam. Key topics: 1D array creation, initialization, and traversal, Array algorithms: minimum, maximum, sum, average, count with condition, Linear search implementation and analysis, Selection sort and insertion sort: trace, understand, implement, ArrayList<E>: add(), remove(), get(), set(), size(), contains(), indexOf(), ArrayList traversal with for loops and enhanced for loops, Forward and backward ArrayList traversal patterns, Safe ArrayList element removal during iteration, 2D array creation and initialization, 2D array row-major and column-major traversal, 2D array partial traversal and boundary conditions, 2D array algorithms: row/column sums, searching, in-place mutation, File reading with java.io.File and java.util.Scanner, Scanner methods: nextLine(), nextInt(), hasNextLine(), Data analysis with collections, Recursion tracing: predicting output of recursive methods.
Study guide content for this unit is being prepared. Check back soon for complete lesson notes, formula sheets, and worked examples.
