AP Computer Science Practice Problems | AP Computer Science Exam Review

MatrixManipulator practice problem

Mar

14

2012

Manipulation of 2 dimensional arrays is testable on the AP Computer Science A Exam. Multiple choice and free response questions are fair game. The MatrixManipulator practice problem is intended as practice with 2D arrays and with the nested loops commonly used to traverse them. The MatrixManipulator practice problem requires extensive manipulation of 2D arrays of ...

Aquarium free response practice question

May

2

2011

Some of the AP Computer Science Free Response Problems require you to manipulate an array or ArrayList in a way that is more complex than just looping through the entire data structure. You may also be required to manipulate the elements inside the structure. This problem is intended as practice with commonly tested manipulations.

GiraffeCritter free response practice question

Mar

24

2011

Note: GridWorld will not be featured on the 2015 and subsequent AP CS Exams. One of the four free response problems on each AP Computer Science Exam references the GridWorld Case Study. Previous problems have required students to write the complete class for a creature that extends Critter.

Grid interface practice test

Mar

23

2011

Note: GridWorld will not be featured on the 2015 and subsequent AP CS Exams. The Grid interface is an important part of the GridWorld Case Study. This practice test is intended to check your understanding of how to use the Grid interface to accomplish common tasks. You should have a copy of the Quick Reference ...

Location class practice test

Mar

23

2011

Note: GridWorld will not be featured on the 2015 and subsequent AP CS Exams. The Location class is an important part of the GridWorld Case Study. This practice test is intended to check your understanding of how to use the Location class to accomplish common tasks. You should have a copy of the Quick Reference ...

Sequential search practice problem

Mar

20

2011

Sequential search is an algorithm in which a data structure, such as an array or a list, not known to be sorted is searched element by element from beginning to end for a specific value.

Selection sort practice problem

Mar

20

2011

Selection sort is an algorithm to arrange the elements of a data structure, such as an array or list, in increasing or decreasing order. The algorithm partitions the array into sorted and unsorted parts and repeatedly finds the minimum (or maximum) in the unsorted part and swaps it with the last element of the sorted ...

Insertion sort practice problem

Mar

20

2011

Insertion sort is an algorithm to arrange the elements of a data structure, such as an array or list, in increasing or decreasing order. The algorithm partitions the array into sorted and unsorted parts and repeatedly inserts the first element of the unsorted part into its correct position in the sorted part.

Binary search practice problem

Mar

20

2011

Binary search is an algorithm in which a data structure, such as an array or a list, known to be in sorted order is searched efficiently for a specific value. Since the data structure is known to be sorted the middle element is checked against the value sought. If the value matches, the index of ...

GridTools free response practice question

Mar

20

2011

Note: GridWorld will not be featured on the 2015 and subsequent AP CS Exams. One of the four free response problems on each AP Computer Science Exam references the GridWorld Case Study. Previous problems have required students to interact with the Grid interface and the Location class in complex ways. This problem is intended as ...