The listing below comes from the College Board Website.
NOTE: We are taking the “AB” exam.

IV. Standard Data Structures

Data structures are used to represent information within a program. Abstraction is an

important theme in the development and application of data structures.

Computer Science A and AB Computer Science AB only

A. Simple data types (int, boolean,double)

B. Classes

C. One-dimensional arrays

D. Arrays/Two-dimensional arrays

E. Linked lists (single, double, circular)

F. Stacks, Queues, Priority Queues

G. Trees - Note it covers both C/C++ and Java.

H. Heaps

I. Sets and Maps*

*Note these are INTERFACES.
*They must IMPLEMENTED by a class.
*We either use Tree or Hash for implementation.
(Visit those links to see by implementation.)

V. Standard Algorithms

Standard algorithms serve as examples of good solutions to standard problems. Many

are intertwined with standard data structures. These algorithms provide examples for

analysis of program efficiency.

Computer Science A and AB Computer Science AB only

A. Operations on A-level data A. Operations on AB-level data

structures previously listed structures previously listed

1. Traversals 1. Traversals

2. Insertions 2. Insertions

3. Deletions 3. Deletions

4. Iterators

B. Searching

1. Sequential

2. Binary

3. Hashing

C. Sorting

1. Selection

2. Insertion

3. Mergesort

4. Quicksort

5. Heapsort