In an array declaration, this indicates the number of elements that the array will have

• subscript

• size declarator

• element sum

• reference variable

Each element of an array is accessed by a number know as a(n):

• subscript

• size declarator

• address

• specifier

The first subscript in an array is always

• 1

• 0

• -1

• 1 less than the number of elements

The last subscript in an array is always

• 100

• 0

• -1

• 1 less than the number of elements

Array bounds checking happens:

• when the program is compiled

• when the program is saved

• when the program runs

• when the program is loaded into memory

This array field holds the number of elements that the array has

• size

• elements

• length

• width

This search algorithm steps through an array, comparing each item with the search value

• binary search

• sequential search

• selection search

• iterative search

This search algorithm repeatedly divides the portion of an array being search in half

• binary search

• sequential search

• selection search

• iterative search

This is the typical number of comparisons performed by the sequential search on an array of N elements (assuming the search values are consistently found)

• 2N

• N

• N/2

When initializing a two-dimensional array, you enclose each row's initialization list in:

• braces

• parentheses

• brackets

• quotation marks