Exam 12: Arrays Continued

When replacing an item in an array, the logical size changes.

You should test sort methods with an array that is already sorted.

The bubble sort algorithm involves a(n) ____________________ loop structure.

David knows that when removing an element, the target index needs to be ____ the logical size

In a(n) ____________________ array, the rows are not all the same length.

When inserting and removing items from an array, the order in which items are shifted is not important.

____ is the process of arranging array elements.

A(n) ____ search assumes the elements are sorted.

A(n) ____________________ search works well for elements that are in ascending order.

Identify the letter of the choice that best matches the phrase or definition. a.Logical size b.Two-dimensional array c.Ragged array d.Tic-tac-toe game e.Drop-down menu -Used to combine commands in a GUI window.

Objects can be compared using the < and > operators.

A(n) ____ search examines every element to determine the absence of a target.

Before sending the compareTo message to an arbitrary object, the object must be cast to ____.

A(n) ____ search starts at the middle of an array.

When inserting an item in an array, start at the ____.

The selection sort will not allow an automatic loop exit if the array becomes ordered during an early pass.

When creating a drop-down menu, each menu item needs to have a(n) ____ attached to it.

FIGURE 12-1 -Figure 12-1 above shows a trace of a(n) ____ search.

One example of a two-dimensional grid is a screen coordinate system for a graphics application.

Selection, bubble, and insertion are simple sort methods that work well for small- and medium-sized arrays.