Chapter 7

Question 1

Anonymous array

Answer 1

An array created without an explicit reference.

Question 2

array

Answer 2

A data structure for storing a collection of data of the same type.

Question 2

array initializer

Answer 2

A short hand notation to create and initialize an array.

Question 3

binary search

Answer 3

An efficient method to search a key in an array. Binary search first compares the key with the element in the middle of the array and reduces the search range by half. For binary search to work, the array must be pre-sorted.

Question 4

garbage collection

Answer 4

A JVM feature that automatically detects and reclaims the space occupied by unreferenced objects.

Question 5

index

Answer 5

An integer value used to specify the position of an element in the array. The array index is an int value starting with 0 for the first element, 1 for the second, and so on.

Question 6

indexed variable

Answer 6

A variable that is represented using an array reference along with an index to refer to an individual element in the array.

Question 7

linear search

Answer 7

A method to search an element array. Linear search compares the key with the element in the array sequentially.

Question 8

off-by-one error

Answer 8

Programmers often mistakenly reference the first element in the array with index 1, but it should be 0. This is called the off-by-one error.

Question 9

postcondition

Answer 9

Used to describe the properties of a method. Postcondition are the things that are true after a method is called.

Question 10

precondition

Answer 10

Used to describe the properties of a method. Precondition are the things that are true before a method is called.

Question 11

selection sort

Answer 11

An approach to sort an array. It finds the largest number in the list and places it last. It then finds the largest number remaining and places it next to last, and so on until the list contains only a single number.