| Term | Definition |
|---|---|
| 1D array | An array with a single row of elements, organized in a linear sequence and accessed using a single index. |
| array | A data structure that stores a fixed-size collection of elements of the same type in contiguous memory locations, accessed by index. |
| ArrayIndexOutOfBoundsException | An error that occurs when attempting to access an array element using an index value outside the valid range of 0 through length minus one. |
| default values | The initial values automatically assigned to instance variables by the default constructor based on their data type (0 for int, 0.0 for double, false for boolean, null for reference types). |
| index | A numeric position in a string, starting from 0 for the first character and going up to one less than the length of the string. |
| initializer list | A syntax used to create and initialize an array with specific values at the time of creation. |
| length attribute | A property of an array that indicates the number of elements it contains and cannot be changed after creation. |
| object reference | A value that points to the memory location where an object is stored, allowing access to that object. |
| primitive values | Basic data types in Java such as int, double, and boolean that store actual values directly. |
| Term | Definition |
|---|---|
| add(E obj) method | An ArrayList method that appends an object to the end of the list and returns true. |
| add(int index, E obj) method | An ArrayList method that inserts an object at a specified position and shifts elements to the right. |
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| generic type | A parameterized type that specifies the data type of elements a collection will contain, such as ArrayList<E>. |
| get(int index) method | An ArrayList method that returns the element at a specified position in the list. |
| import statement | A Java statement used to make classes from a package available for use in a program. |
| index | A numeric position in a string, starting from 0 for the first character and going up to one less than the length of the string. |
| java.util package | A Java library package that contains utility classes including ArrayList. |
| mutable | Capable of being changed or modified after creation, such as an ArrayList that can grow or shrink in size. |
| object reference | A value that points to the memory location where an object is stored, allowing access to that object. |
| remove(int index) method | An ArrayList method that removes the element at a specified position and shifts elements to the left. |
| set(int index, E obj) method | An ArrayList method that replaces the element at a specified position and returns the former element. |
| size() method | An ArrayList method that returns the number of elements currently in the list. |
| type parameter | A placeholder for a specific data type in a generic class, represented by E in ArrayList<E>. |
| Term | Definition |
|---|---|
| array index | The numeric position used to access a specific element in an array. |
| array traversal | The process of using repetition statements to systematically access elements in an array. |
| enhanced for loop | A Java loop construct that iterates through all elements of a collection without using an index variable. |
| enhanced for loop variable | The variable in an enhanced for loop header that is assigned a copy of each array element during each iteration. |
| indexed for loop | A loop that accesses array elements by using their index positions to control iteration. |
| object reference | A value that points to the memory location where an object is stored, allowing access to that object. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| while loop | An iterative statement that repeatedly executes a block of code as long as a specified Boolean expression evaluates to true. |
| Term | Definition |
|---|---|
| algorithm | A step-by-step procedure or set of rules designed to solve a problem or accomplish a task. |
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| average | The mean value calculated by dividing the sum of all values by the number of values. |
| delete elements | The operation of removing elements from a collection. |
| duplicate elements | Multiple occurrences of the same value within a collection. |
| insert elements | The operation of adding new elements into a collection at a specified position. |
| maximum value | The largest value in a set of data or collection of numbers. |
| minimum value | The smallest value in a set of data or collection of numbers. |
| reverse | To arrange elements in an array in the opposite order from their original sequence. |
| rotate elements | To move elements in an array circularly so that elements shifted off one end reappear at the other end. |
| shift elements | To move all elements in an array left or right by one or more positions. |
| sum | The result of adding multiple values together. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| Term | Definition |
|---|---|
| array traversal | The process of using repetition statements to systematically access elements in an array. |
| average | The mean value calculated by dividing the sum of all values by the number of values. |
| consecutive pairs | Two adjacent elements in an array that are next to each other in sequence. |
| duplicate elements | Multiple occurrences of the same value within a collection. |
| maximum value | The largest value in a set of data or collection of numbers. |
| minimum value | The smallest value in a set of data or collection of numbers. |
| reverse | To arrange elements in an array in the opposite order from their original sequence. |
| rotate elements | To move elements in an array circularly so that elements shifted off one end reappear at the other end. |
| shift elements | To move all elements in an array left or right by one or more positions. |
| sum | The result of adding multiple values together. |
| Term | Definition |
|---|---|
| 2D array | A two-dimensional data structure consisting of rows and columns used to store and organize data in a grid format. |
| algorithm | A step-by-step procedure or set of rules designed to solve a problem or accomplish a task. |
| average | The mean value calculated by dividing the sum of all values by the number of values. |
| consecutive pairs | Two adjacent elements in an array that are next to each other in sequence. |
| duplicate elements | Multiple occurrences of the same value within a collection. |
| maximum value | The largest value in a set of data or collection of numbers. |
| minimum value | The smallest value in a set of data or collection of numbers. |
| reverse | To arrange elements in an array in the opposite order from their original sequence. |
| rotate elements | To move elements in an array circularly so that elements shifted off one end reappear at the other end. |
| shift elements | To move all elements in an array left or right by one or more positions. |
| sum | The result of adding multiple values together. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| Term | Definition |
|---|---|
| 2D array | A two-dimensional data structure consisting of rows and columns used to store and organize data in a grid format. |
| ArrayIndexOutOfBoundsException | An error that occurs when attempting to access an array element using an index value outside the valid range of 0 through length minus one. |
| arrays of arrays | A data structure where a 2D array is implemented as an array where each element is itself a 1D array. |
| column index | The second index in the square brackets [row][col] notation used to specify which column of a 2D array to access. |
| default values | The initial values automatically assigned to instance variables by the default constructor based on their data type (0 for int, 0.0 for double, false for boolean, null for reference types). |
| initializer list | A syntax used to create and initialize an array with specific values at the time of creation. |
| length attribute | A property of an array that indicates the number of elements it contains and cannot be changed after creation. |
| object reference data | Data types that store references to objects rather than primitive values. |
| primitive data | Basic data types in Java such as int, double, and boolean that store values directly. |
| row index | The first index in the square brackets [row][col] notation used to specify which row of a 2D array to access. |
| Term | Definition |
|---|---|
| 1D array | An array with a single row of elements, organized in a linear sequence and accessed using a single index. |
| 2D array | A two-dimensional data structure consisting of rows and columns used to store and organize data in a grid format. |
| arrays of arrays | A data structure where a 2D array is implemented as an array where each element is itself a 1D array. |
| column-major order | A traversal pattern of a 2D array where elements are accessed down each column from top to bottom before moving to the next column. |
| enhanced for loop | A Java loop construct that iterates through all elements of a collection without using an index variable. |
| nested iteration statements | Loop structures where one loop is placed inside another, used to access all elements in a 2D array. |
| row-major order | A traversal pattern of a 2D array where elements are accessed across each row from left to right before moving to the next row. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| Term | Definition |
|---|---|
| algorithmic bias | Systemic and repeated errors in a program that create unfair outcomes for a specific group of users. |
| bias | Systematic prejudice or error in data collection or program logic that leads to unfair or inaccurate outcomes. |
| data collection | The process of gathering information about individuals through computer systems and other means. |
| data quality | The accuracy, completeness, and reliability of data in a dataset, which affects the correctness of programs and conclusions drawn from the data. |
| data set | A collection of related data values that can be analyzed to answer questions or solve problems. |
| data set collection method | The process and technique used to gather data for a dataset, which can introduce bias or affect data quality. |
| data storage | The process of keeping collected personal information on computer systems for later access or use. |
| inaccurate data | Data that contains errors or does not correctly represent the actual values or facts, potentially causing program malfunction. |
| incomplete data | A dataset that is missing information or records, which can cause programs to work incorrectly or inefficiently. |
| personal data | Information about individuals that can be used to identify them or reveal details about their lives, activities, or characteristics. |
| privacy | The right of individuals to control access to their personal information and have it protected from unauthorized collection, use, or disclosure. |
| safeguard | Protective measures taken to prevent unauthorized access to or misuse of personal data. |
| Term | Definition |
|---|---|
| algorithm | A step-by-step procedure or set of rules designed to solve a problem or accomplish a task. |
| chart | A visual representation of data used to organize and display information in a way that aids understanding and planning. |
| data set | A collection of related data values that can be analyzed to answer questions or solve problems. |
| table | A structured visual representation of data organized in rows and columns that can be used to plan algorithms. |
| Term | Definition |
|---|---|
| close() | A Scanner method that closes the scanner and the associated file when the program is finished using it. |
| file | A storage location for data that persists when a program is not running and can be retrieved during program execution. |
| File class | A Java class used to create a File object that connects a program to a text file for reading data. |
| hasNext() | A Scanner method that returns true if there is another item to read in the file or input source, and false otherwise. |
| import statement | A Java statement used to make classes from a package available for use in a program. |
| InputMismatchException | An exception thrown when a Scanner method attempts to read a value that does not match the expected data type or is out of range. |
| IOException | An exception class that is thrown when a file cannot be opened or read due to an invalid file name or I/O error. |
| java.io package | A Java package containing classes like File and IOException that must be imported to use file input/output operations. |
| next() | A Scanner method that returns the next String token read from a file or input source. |
| nextBoolean() | A Scanner method that returns the next boolean value read from a file or input source. |
| nextDouble() | A Scanner method that returns the next double value read from a file or input source. |
| nextInt() | A Scanner method that returns the next integer value read from a file or input source. |
| nextLine() | A Scanner method that returns the next line of text as a String read from a file or input source. |
| Scanner class | A Java class used to obtain and parse text input from the keyboard or other input sources. |
| split() | A String method that returns a String array by dividing a String into substrings based on a given delimiter expression. |
| throws IOException | A method declaration clause that indicates the method may throw an IOException if a file cannot be opened. |
| while loop | An iterative statement that repeatedly executes a block of code as long as a specified Boolean expression evaluates to true. |
| whitespace | Blank characters such as spaces, tabs, and newlines that Scanner methods handle differently when reading from a file. |
| Term | Definition |
|---|---|
| array | A data structure that stores a fixed-size collection of elements of the same type in contiguous memory locations, accessed by index. |
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| ArrayList objects | Resizable collections in Java that can dynamically grow or shrink and can be traversed recursively. |
| binary search algorithm | A search algorithm that finds a target value in a sorted collection by repeatedly dividing the search space in half, eliminating half of the remaining elements with each iteration. |
| iteration | A form of repetition in which code is executed zero or more times based on a condition. |
| iteratively | A method of solving a problem by repeating a set of instructions in a loop rather than through recursive function calls. |
| linear search | A search algorithm that examines each element in a collection sequentially from the beginning until the target value is found or the end is reached. |
| merge sort | A recursive sorting algorithm that divides an array into smaller subarrays, sorts them, and then merges them back together in sorted order. |
| recursion | A programming technique where a function calls itself to solve a problem by breaking it into smaller, similar subproblems. |
| recursive algorithms | Algorithms that solve problems by having a function call itself with modified parameters until reaching a base case. |
| recursive call | An instance where a method invokes itself as part of its execution. |
| recursive sorting algorithm | A sorting algorithm that uses recursion to divide and organize elements in a collection. |
| recursively | A method of solving a problem by having a function call itself with modified parameters until a base case is reached. |
| sorted order | A requirement for binary search in which elements in a collection are arranged in a specific sequence, typically in ascending or descending order. |
| String objects | Data structures in Java that represent sequences of characters and can be traversed recursively. |
| subarray | A contiguous portion of an array. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| Term | Definition |
|---|---|
| base case | A condition in a recursive method that stops the recursion and prevents infinite calls. |
| iterative approach | A method of solving a problem using loops and repetition instead of recursion. |
| local variables | Variables declared in the headers or bodies of blocks of code that can only be accessed within the block in which they are declared. |
| parameters | Variables that allow procedures to be generalized and reused with a range of input values or arguments. |
| recursive call | An instance where a method invokes itself as part of its execution. |
| recursive method | A method that calls itself to solve a problem by breaking it down into smaller instances of the same problem. |
| Term | Definition |
|---|---|
| array | A data structure that stores a fixed-size collection of elements of the same type in contiguous memory locations, accessed by index. |
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| insertion sort | An iterative sorting algorithm that inserts elements from the unsorted portion into their correct position in the sorted portion by shifting elements to make room. |
| iterative sorting algorithms | Sorting algorithms that use repetition to progressively sort elements by performing the same operation multiple times. |
| selection sort | An iterative sorting algorithm that repeatedly selects the smallest or largest element from the unsorted portion and places it in its correct final position in the sorted portion. |
| sorted portion | The part of a collection that has been arranged in the desired order during a sorting process. |
| sorting algorithms | Step-by-step procedures used to arrange elements in a collection in a specific order, such as ascending or descending. |
| swap | The operation of exchanging the positions of two elements in a collection. |
| unsorted portion | The part of a collection that has not yet been arranged in the desired order during a sorting process. |
| Term | Definition |
|---|---|
| 2D array | A two-dimensional data structure consisting of rows and columns used to store and organize data in a grid format. |
| array | A data structure that stores a fixed-size collection of elements of the same type in contiguous memory locations, accessed by index. |
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| linear search algorithms | Standard algorithms that check each element in a collection in order until the desired value is found or all elements have been checked. |
| Term | Definition |
|---|---|
| ArrayList | A resizable array implementation in Java that can dynamically grow or shrink to store a collection of objects. |
| ConcurrentModificationException | An exception that occurs when the size of an ArrayList is changed while traversing it using an enhanced for loop. |
| enhanced for loop | A Java loop construct that iterates through all elements of a collection without using an index variable. |
| IndexOutOfBoundsException | An exception that occurs when attempting to access an index value outside the valid range of an ArrayList. |
| iteration | A form of repetition in which code is executed zero or more times based on a condition. |
| recursive statements | Programming statements that call themselves to process elements in a data structure. |
| traverse | To visit each element in a data structure (such as a string, array, or ArrayList) in a systematic way, often using recursion. |
| Term | Definition |
|---|---|
| autoboxing | The automatic conversion by the Java compiler from a primitive type to its corresponding wrapper class object, such as converting an int to an Integer or a double to a Double. |
| Double class | A wrapper class in the java.lang package that represents a primitive double value as an object; Double objects are immutable. |
| immutable | A property of String objects meaning that once created, their content cannot be changed; methods called on a String return a new String rather than modifying the original. |
| Integer class | A wrapper class in the java.lang package that represents a primitive int value as an object; Integer objects are immutable. |
| parseDouble | A static method of the Double class that converts a String argument to a double value. |
| parseInt | A static method of the Integer class that converts a String argument to an int value. |
| primitive type | A basic data type in Java such as int or double that is not an object. |
| unboxing | The automatic conversion by the Java compiler from a wrapper class object to its corresponding primitive type, such as converting an Integer to an int or a Double to a double. |
| wrapper class | A class that encapsulates a primitive data type and provides object-oriented functionality, such as Integer and Double. |