Increasingly complex manipulations of 2D arrays have been featured on the AP Computer Science A Exam. This exercise includes traversals, swaps and other manipulations of 2 dimensional arrays. The AP CS Pictures Lab makes extensive use of 2D arrays.

This problem is intended as practice with traversal of 2D arrays and with String manipulation. The AP CS Magpie Lab demonstrates String manipulation. The AP CS Pictures Lab demonstrates 2D array traversal.

On the AP Computer Science Exam, you will be expected to be familiar with Math.random. You may be asked to use it to generate a random value within a specific range, generate a random valid index in an array or list, or make a conditional statement true with a specific probability. The AP CS Elevens ...

Manipulation of 2 dimensional arrays is testable on the AP Computer Science A Exam. Multiple choice and free response questions are fair game. The DeterminantFinder practice problem is intended as practice with 2D arrays and with recursion. The DeterminantFinder practice problem requires complex manipulation of 2D arrays of integers. It also requires coding a recursive ...

Note: GridWorld will not be featured on the 2015 and subsequent AP CS Exams. As the name suggests, the AP Computer Science GridWorld Case Study is based on a grid. The GridWorld Student Manual places Actor objects in the grid; however, it can actually store objects of any type. This makes the grid useful for ...

Conversion between bases is typically a single question on the AP Computer Science Exam. In this practice problem, you’ll be presented with algorithms to convert between base 10 and another base then asked to implement each algorithm as a recursive method. Base 2 is used as the non-integer base in throughout this problem; however, both ...

Two dimensional arrays are tested on the AP Computer Science A Exam, often with a free response question. You will probably be required to loop through the entire data structure in a specified order. You might be required to loop through part of the data structure, which is more complex. This problem is intended as ...

Merge sort is a recursive algorithm to arrange the elements of a data structure, such as an array or list, in increasing or decreasing order. The algorithm partitions the portion of the array into 2 unsorted halves, sorts each half, then merges the 2 sorted halves into 1 sorted whole.