AP CSA Daily Practice
Unit 4 Day 28: Unit 4 Review II
Unit 4, Section 4.11-4.13 Day 28 Practice Focus: 2D arrays and ArrayList review Practice Question Consider the following ArrayList operations:What does list contain? ArrayList list = new ArrayList(); list.add("A"); list.add("B");...
Unit 4 Day 28: Unit 4 Review II
Unit 4, Section 4.11-4.13 Day 28 Practice Focus: 2D arrays and ArrayList review Practice Question Consider the following ArrayList operations:What does list contain? ArrayList list = new ArrayList(); list.add("A"); list.add("B");...
Unit 4 Day 27: Unit 4 Review I
Unit 4, Section 4.1-4.10 Day 27 Practice Focus: Arrays review Practice Question Consider the following code segment:What is x? int[] arr = {5, 3, 8, 1, 9, 2}; int x...
Unit 4 Day 27: Unit 4 Review I
Unit 4, Section 4.1-4.10 Day 27 Practice Focus: Arrays review Practice Question Consider the following code segment:What is x? int[] arr = {5, 3, 8, 1, 9, 2}; int x...
Unit 4 Day 26: 2D Array Edge Cases
Unit 4, Section 4.11-4.13 Day 26 Practice Focus: Boundary conditions Practice Question In a countNeighbors method for a 3x3 grid:What is the purpose of (i >= 0 && i <...
Unit 4 Day 26: 2D Array Edge Cases
Unit 4, Section 4.11-4.13 Day 26 Practice Focus: Boundary conditions Practice Question In a countNeighbors method for a 3x3 grid:What is the purpose of (i >= 0 && i <...
Unit 4 Day 25: ArrayList Filtering
Unit 4, Section 4.8 Day 25 Practice Focus: Creating filtered lists Practice Question Consider the filtering method:For nums = [3, 8, 1, 4, 7, 2], what's returned? public static ArrayList...
Unit 4 Day 25: ArrayList Filtering
Unit 4, Section 4.8 Day 25 Practice Focus: Creating filtered lists Practice Question Consider the filtering method:For nums = [3, 8, 1, 4, 7, 2], what's returned? public static ArrayList...
Unit 4 Day 24: Array Modification
Unit 4, Section 4.4 Day 24 Practice Focus: In-place array modifications Practice Question Consider the following code segment:What are the contents of arr? int[] arr = {1, 2, 3, 4,...
Unit 4 Day 24: Array Modification
Unit 4, Section 4.4 Day 24 Practice Focus: In-place array modifications Practice Question Consider the following code segment:What are the contents of arr? int[] arr = {1, 2, 3, 4,...
Unit 4 Day 23: Search Efficiency
Unit 4, Section 4.9 Day 23 Practice Focus: Comparing search algorithms Practice Question For 1,000,000 sorted integers, what is the maximum comparisons for binary search? A) 10 B) 20 C)...
Unit 4 Day 23: Search Efficiency
Unit 4, Section 4.9 Day 23 Practice Focus: Comparing search algorithms Practice Question For 1,000,000 sorted integers, what is the maximum comparisons for binary search? A) 10 B) 20 C)...
Unit 4 Day 22: 2D Array Patterns
Unit 4, Section 4.13 Day 22 Practice Focus: Common 2D array patterns Practice Question Consider the following code segment:What is sum? int[][] grid = {{1, 2, 3}, {4, 5, 6},...
Unit 4 Day 22: 2D Array Patterns
Unit 4, Section 4.13 Day 22 Practice Focus: Common 2D array patterns Practice Question Consider the following code segment:What is sum? int[][] grid = {{1, 2, 3}, {4, 5, 6},...
Unit 4 Day 19: ArrayList Removal
Learn the backwards iteration technique for safely removing elements from an ArrayList without skipping elements.
Unit 4 Day 19: ArrayList Removal
Learn the backwards iteration technique for safely removing elements from an ArrayList without skipping elements.
Unit 4 Day 18: 2D Array Row/Column Sums
Practice summing rows and columns in 2D arrays using nested loops with proper row and column indexing.
Unit 4 Day 18: 2D Array Row/Column Sums
Practice summing rows and columns in 2D arrays using nested loops with proper row and column indexing.
Unit 4 Day 17: ArrayList vs Array
Compare ArrayList and arrays: dynamic vs fixed size, wrapper classes vs primitives, methods vs bracket notation.
Unit 4 Day 17: ArrayList vs Array
Compare ArrayList and arrays: dynamic vs fixed size, wrapper classes vs primitives, methods vs bracket notation.
Unit 4 Day 16: Insertion Sort
Understand insertion sort - inserting each element into its correct position within the sorted portion of the array.
Unit 4 Day 16: Insertion Sort
Understand insertion sort - inserting each element into its correct position within the sorted portion of the array.
Unit 4 Day 15: Selection Sort
Trace through selection sort - finding the minimum element and swapping it to the front of the unsorted portion.
Unit 4 Day 15: Selection Sort
Trace through selection sort - finding the minimum element and swapping it to the front of the unsorted portion.
Unit 4 Day 14: Sorting Algorithms
Unit 4, Section 4.9 Day 14 Practice • Cycle 2 SECOND PASS 🎯 Focus: Selection Sort Algorithm Tracing HARD Practice Question Consider the following implementation of selection sort: public static...
Unit 4 Day 14: Sorting Algorithms
Unit 4, Section 4.9 Day 14 Practice • Cycle 2 SECOND PASS 🎯 Focus: Selection Sort Algorithm Tracing HARD Practice Question Consider the following implementation of selection sort: public static...
Unit 4 Day 1: Introduction to Data Collections ...
Unit 4: Data Collections Day 1: Introduction to Arrays AP CSA Daily Practice | 2025-2026 Curriculum Practice Question Consider the following code segment: int[] nums = {10, 20, 30, 40,...
Unit 4 Day 1: Introduction to Data Collections ...
Unit 4: Data Collections Day 1: Introduction to Arrays AP CSA Daily Practice | 2025-2026 Curriculum Practice Question Consider the following code segment: int[] nums = {10, 20, 30, 40,...
Unit 4 Day 13: Binary Search
Practice tracing binary search and understanding its efficiency. Learn how binary search eliminates half the elements each iteration.
Unit 4 Day 13: Binary Search
Practice tracing binary search and understanding its efficiency. Learn how binary search eliminates half the elements each iteration.
Unit 4 Day 12: 2D Array Algorithms
Practice the neighbor-counting algorithm pattern for 2D arrays. Learn how to check all 8 adjacent cells while handling boundary conditions.
Unit 4 Day 12: 2D Array Algorithms
Practice the neighbor-counting algorithm pattern for 2D arrays. Learn how to check all 8 adjacent cells while handling boundary conditions.
Unit 4 Day 11: 2D Array Traversal
Practice column-major vs row-major traversal of 2D arrays. Learn why the traversal order doesn't affect the sum but does affect the visitation sequence.
Unit 4 Day 11: 2D Array Traversal
Practice column-major vs row-major traversal of 2D arrays. Learn why the traversal order doesn't affect the sum but does affect the visitation sequence.
Unit 4 Day 10: 2D Array Basics
Practice understanding 2D array structure, dimensions, and indexing. Learn the difference between grid.length (rows) and grid[0].length (columns).
Unit 4 Day 10: 2D Array Basics
Practice understanding 2D array structure, dimensions, and indexing. Learn the difference between grid.length (rows) and grid[0].length (columns).
Unit 4 Day 9: ArrayList Traversal
Practice ArrayList traversal with removal using backward loops. Learn why backward traversal avoids the index-shifting problem when removing elements.
Unit 4 Day 9: ArrayList Traversal
Practice ArrayList traversal with removal using backward loops. Learn why backward traversal avoids the index-shifting problem when removing elements.
AP CSA Unit 4.7: Wrapper Classes and Autoboxing...
Master wrapper classes with this AP CSA practice question. ArrayLists require objects, so primitives are automatically wrapped (autoboxing) and unwrapped (unboxing). Integer wraps int, allowing seamless ArrayList operations with numeric...
AP CSA Unit 4.7: Wrapper Classes and Autoboxing...
Master wrapper classes with this AP CSA practice question. ArrayLists require objects, so primitives are automatically wrapped (autoboxing) and unwrapped (unboxing). Integer wraps int, allowing seamless ArrayList operations with numeric...
AP CSA Unit 4.6: File Processing and ArrayList ...
Master file processing concepts with this AP CSA practice question. When reading from a file into an ArrayList, the list grows dynamically—its size equals the number of items read. Understanding...
AP CSA Unit 4.6: File Processing and ArrayList ...
Master file processing concepts with this AP CSA practice question. When reading from a file into an ArrayList, the list grows dynamically—its size equals the number of items read. Understanding...
AP CSA Unit 4.4: Array Traversal and Element Mo...
Master array traversal with this AP CSA practice question. Use index-based for loops when you need to modify array elements—enhanced for loops cannot change the array! After doubling all values,...
AP CSA Unit 4.4: Array Traversal and Element Mo...
Master array traversal with this AP CSA practice question. Use index-based for loops when you need to modify array elements—enhanced for loops cannot change the array! After doubling all values,...
AP CSA Unit 4.5: Find Maximum Algorithm Practice
Master the find-maximum algorithm with this AP CSA practice question. Start with the first element as max, then compare each subsequent element and update when larger. This classic pattern appears...
AP CSA Unit 4.5: Find Maximum Algorithm Practice
Master the find-maximum algorithm with this AP CSA practice question. Start with the first element as max, then compare each subsequent element and update when larger. This classic pattern appears...
AP CSA Unit 4.2: Array Averaging with Enhanced ...
Master data set analysis with this AP CSA practice question. Use an enhanced for loop to sum array values, then calculate the average. Remember to cast to double before dividing...
AP CSA Unit 4.2: Array Averaging with Enhanced ...
Master data set analysis with this AP CSA practice question. Use an enhanced for loop to sum array values, then calculate the average. Remember to cast to double before dividing...
AP CSA Unit 4.1: Data Privacy and Ethics Practice
Master data privacy concepts with this AP CSA ethics question. Analyze a real-world scenario about anonymized data and re-identification risks. This medium-difficulty problem tests your understanding of responsible computing and...
AP CSA Unit 4.1: Data Privacy and Ethics Practice
Master data privacy concepts with this AP CSA ethics question. Analyze a real-world scenario about anonymized data and re-identification risks. This medium-difficulty problem tests your understanding of responsible computing and...