📚 Topic Summary
Arrays are fundamental data structures in Java, used to store a collection of elements of the same type. Think of them as a numbered list where you can access each item using its index, starting from 0. They're super useful for organizing and manipulating data efficiently! This worksheet will explore basic array concepts and their implementation in Java.
🧠 Part A: Vocabulary
Match each term with its correct definition:
| Term |
Definition |
| 1. Index |
A. A data structure storing elements of the same type. |
| 2. Array |
B. The process of going through each element in an array. |
| 3. Element |
C. The position of a value in an array. |
| 4. Length |
D. A single value stored in an array. |
| 5. Traversal |
E. The number of items an array can hold. |
(Match the number to the letter. Example: 1-A)
✏️ Part B: Fill in the Blanks
Arrays in Java are ________ data structures, meaning their size is fixed once created. Each element in an array can be accessed using its ________, which starts at ________. To declare an array of integers named `numbers` with a size of 5, you would write: `int[] numbers = new int[________];`. The last element in this array can be accessed using the index ________.
🤔 Part C: Critical Thinking
Explain why arrays are useful in programming and provide an example scenario where using an array would be more efficient than using individual variables.