AP Computer Science A is equivalent to a first-semester, college level course in computer science. The course introduces problem

solving and programming using Java. The topics are outlined in http://media.collegeboard.com/digitalServices/pdf/ap/ap-course-
overviews/ap-computer-science-a-course-overview.pdf. Here is the mapping for the topics to the text.

AP® Topic Covered in the Text
Part I.A Program and class design r Program design is discussed throughout the book.
r Class design is discussed in Chapters 9–13.

Part II.A Implementation techniques

r Simple program implementation is introduced in Chapters 2–5.
r Method implementation is presented in Chapter 6.
r Class implementation is covered in Chapters 9–13.

Part II.B Programming constructs

r The if-else, switch, and conditional statements are covered in Chapter 3.
r The loops are covered in Chapter 5.
r The arrays are covered in Chapters 7 and 8.
r The classes and objects are covered in Chapters 9–13.

Part II.C Java library classes and
interfaces included in the AP Java Subset

r The AP Java subset classes and methods are all covered, including the toString, equals
methods in the Object class (Sections 11.6, 11.10), the Integer and Double classes

(Section 10.7), the String class (Section 4.4 and Section 10.10), the Math class (Sec-
tion 4.2), the ArrayList class (Section 11.11), and the List interface (Section 13.8).

Part III.A Testing r Program testing is discussed throughout the book.
Part III.B Debugging r Debugging techniques are covered in Chapter 2.
Part III.C Runtime exceptions r Chapter 12
Part III.D Program correctness r Program correctness is covered throughout the book.
Part III.E Algorithm analysis r Chapter 7 and Chapter 14
Part III.F Numerical representations of
integers

r Chapter 2

Part IV.A Primitive data types (int,
boolean, double)

r Chapters 2 and 3
Part IV.B Strings r Sections 4.4 and 10.10
Part IV.C Classes r Chapters 9 and 10
Part IV.D Lists r The ArrayList class is covered in Section 11.11 and List interface is covered in

Section 13.8.

Part IV.E Arrays (1-dimensional
and 2-dimensional)

r Chapters 7 and 8
Part V.A. Operations on data structures r Chapters 7, 8, 10, and 13
Part V.B Searching r Linear Search is covered in Section 7.10.1.
r Binary search is covered in Section 11.10.2.

Part V.C Sorting

r Selection sort is covered in Section 7.11.1.
r Insertion sort is covered in Section 7.11.2.
r Merge sort is covered in Section 14.8.

0 comments:

 
Top