Course Description

Computer Science A with Java 4
2D Arrays, Recursion, and Software Development
Purpose: Consolidates advanced data-structure reasoning and integrates the full sequence through capstone development and final review.
Key student outcomes

Write and trace 2D array methods using safe row/column logic.

Solve grid problems involving neighbors, patterns, and transformations.

Analyze recursion and reason about base cases and call flow.

Plan, build, test, and refine a medium-size Java program.

Demonstrate readiness for the next CS course through cumulative assessment.
Units and topics

1. 2D arrays and grid reasoning
row-major traversal, aggregations, bounds checking, neighborhood logic, context problems
2. Recursion foundations
self-similar problems, base cases, tracing calls, conceptual call stack
3. Recursive analysis and debugging
design recipe, string or array recursion analysis, common bugs, iteration vs recursion
4. Capstone software development
proposal, architecture, coding, testing, debugging, showcase, final reflection