Ch. 6 Test Tuesday
Review the following

You will be given a list of sorted number and asked to perform a binary search.

You will be asked to
complete a class declaration - fill in the constructor, get and set, behaviors and toString methods
create an ArrayList of objects, add, remove, set, print objects in the list (p. 359)

You will be asked to sort lists of number using the following sorts:
bubble sort
insertion sort
selection sort

You will be asked to define Big O Notation and know the efficiency of insertion and selection sorts

You will be asked to write some essential array methods of the type we have studied in the past, such as
min, max, hasNum, countOccurrences etc.

You will be asked questions based on Ch. 6 Multiple Choice, TF, and AP Style MC, as well as any key points throughout the chapter (see blue highlight points and key concepts p. 376)

Classwork:

1)  p. 385 - 386 AP Style MC  (ANSWERS ONLY)
2)  Array Section of Javabat