1. Declare the array with type[] arrayName;. 2. Initialize the array with arrayName = new type[arraySize]; or type[] arrayName = {value1, value2, ...};

1. Use the array name followed by square brackets. 2. Inside the brackets, specify the index of the element you want to access (e.g., arrayName[index]).

1. Initialize a loop counter i to 0. 2. Set the loop condition to i < array.length. 3. Increment i in each iteration. 4. Access each element using array[i].

1. Initialize minValue to the first element of the array. 2. Iterate through the array. 3. If the current element is less than minValue, update minValue to the current element. 4. After iteration, minValue holds the minimum value.

1. Create a new array of the same size. 2. Iterate through the original array from the last element to the first. 3. Copy each element to the new array in reverse order. 4. The new array contains the reversed elements.

1. Store the last element. 2. Iterate from the second-to-last element to the first. 3. Move each element to the next index. 4. Place the stored last element in the first index.

1. Initialize a boolean variable allMeetCriteria to true. 2. Iterate through the array. 3. If any element does not meet the criteria, set allMeetCriteria to false and break the loop. 4. After iteration, allMeetCriteria indicates whether all elements meet the criteria.

1. Initialize a variable sum to 0. 2. Iterate through the array, adding each element to sum. 3. Divide sum by the number of elements in the array to get the average.

1. Use nested loops to compare each element with every other element. 2. If any two elements are equal and have different indices, there are duplicates. 3. Return true if duplicates are found, false otherwise.

1. Store the first element. 2. Iterate from the second element to the last element. 3. Move each element to the previous index. 4. Place the stored first element in the last index.

A container object that holds a fixed number of values of a single type.

The position of an element within an array, starting from 0.

The process of visiting each element in an array and performing some operation on it.

An exception thrown when trying to access an array element with an invalid index (e.g., negative or beyond the array's length).

A simplified for loop for iterating over elements in an array without needing to manage indices directly.

A system where the first element of an array has an index of 0, the second has an index of 1, and so on.

An exception thrown when attempting to use a reference that points to null (no object).

A way of organizing and storing data in a computer so that it can be used efficiently.

Basic data types such as int, boolean, and double that are built into a programming language.

Data types that store the memory address of an object, such as String and arrays.

Assigning an initial size and optionally values to the elements of an array when it is created.

Array indices provide a way to access and manipulate individual elements within the array.

Iterating through each element of the array to perform an operation.

Accessing an invalid index can lead to program crashes or unexpected behavior.

It provides a concise way to iterate through array elements without managing indices, but it can't modify the array.

The elements of the array will be initialized with the default values for their type (e.g., 0 for int, false for boolean, null for objects).

Arrays are fixed in size to ensure memory allocation is contiguous and efficient, which allows for fast access to elements.

Loops allow for efficient processing of each element in an array, such as modifying values, searching for specific elements, or performing calculations.

Finding min/max values, computing sums/averages, determining if elements meet certain criteria, shifting/rotating elements, and reversing order.

They cannot be used to modify the original array, and they do not provide access to the index of the elements.