Unit 6: Arrays

Question 1

2-D Arrays

Answer 1

Rectangular grids or matrices consisting of rows and columns. They allow for storing and accessing elements using two indices - one for row number and another for column number.

Question 2

Accessing Elements in Arrays

Answer 2

Refers to retrieving or obtaining the value stored at a specific index position within an array.

Question 3

Array Algorithms

Answer 3

Step-by-step procedures designed specifically for manipulating or processing arrays efficiently.

Question 4

Array Creation and Access

Answer 4

Refers to the process of creating an array, which is a container object that holds a fixed number of elements of the same type, and accessing its individual elements by their index positions.

Question 5

ArrayIndexOutOfBoundsException

Answer 5

An exception that occurs when trying to access an invalid index position in an array. It is thrown to indicate that the index used to access an array is either negative or greater than or equal to the size of the array.

Question 6

Arrays

Answer 6

Are a collection of elements of the same data type, stored in contiguous memory locations. They have a fixed size and can be accessed using an index.

Question 7

Average

Answer 7

Also known as the mean, is calculated by dividing the sum of a set of numbers by how many numbers are in that set.

Question 8

Consecutive Pairs of Elements

Answer 8

Refers to two adjacent elements in a sequence or array.

Question 9

Data Structures

Answer 9

Data structures are ways to organize, store, and manipulate data efficiently. They provide different methods of accessing, inserting, deleting, or searching for data elements based on specific requirements.

Question 10

Default Values

Answer 10

This term refers to the initial values automatically assigned by Java if no explicit value is provided for variables during declaration.

Question 11

Developing Algorithms Using Arrays

Answer 11

Refers to the process of creating step-by-step instructions to solve a problem or perform a task, specifically using arrays as a data structure. It involves breaking down complex problems into smaller, manageable steps and utilizing array operations to manipulate and access data efficiently.

Question 12

Enhanced For Loop (For-each Loop)

Answer 12

A simplified loop structure introduced in Java that allows easy iteration over arrays or collections without explicitly managing an index or iterator.

Question 13

Exam Weighting

Answer 13

Refers to the allocation of points or marks given to each section or topic in an exam. It determines how much each part contributes to the overall score.

Question 14

For Loop

Answer 14

A control flow statement that allows you to repeatedly execute a block of code for a specified number of times or until certain conditions are met.

Question 15

FRQ

Answer 15

It is a type of question commonly found in AP Computer Science A exams where students are required to write code or provide detailed explanations without multiple-choice options.

Question 16

Mode

Answer 16

Refers to the value that appears most frequently in a set of data.

Question 17

NullPointerException

Answer 17

An exception that occurs when a program tries to access or use an object that has not been initialized, meaning it is currently set to “null”.

Question 18

Object

Answer 18

An instance of a class that represents a specific entity or thing in a program. It contains both data (attributes) and behavior (methods).

Question 19

Rotate

Answer 19

Refers to the action of shifting the order of elements either to the left or right. It is like rearranging a line of people by moving them in a circular motion.

Question 20

sum

Answer 20

Refers to the result obtained by adding two or more numbers together.

Question 21

Traverse an Array

Answer 21

To visit each element in the array, usually in order, to perform some operation on it.

Question 22

Traversing Arrays

Answer 22

Refers to the process of accessing and examining each element in an array. It allows you to perform operations on every element or search for specific values within the array.

Question 23

ArrayLists

Answer 23

Dynamic arrays that can grow and shrink dynamically as needed. They provide resizable arrays with additional methods for easy manipulation and management.

Question 24

arrayName.length

Answer 24

This property is used to determine the number of elements in an array.

Question 25

arrayName[index]

Answer 25

The syntax used in programming languages to access a specific element within an array. “arrayName” represents the name of the array, and “index” refers to the position of the desired element.

Question 26

Arrays

Answer 26

A collection of elements of the same data type, stored in contiguous memory locations. They have a fixed size and can be accessed using an index.

Question 27

Constructor

Answer 27

A special method within a class that is used to initialize objects of that class. It is called automatically when an object is created and helps set initial values for its attributes.

Question 28

fixed size

Answer 28

Refers to a data structure or container whose size cannot be changed once it is created. Once initialized with a specific capacity or length, no additional elements can be added or removed from it.

Question 29

For Loops

Answer 29

Control structures used for repetitive execution of code blocks. They consist of an initialization statement, condition statement, increment/decrement statement, and loop body. The loop continues until the condition becomes false.

Question 30

Primitive data type

Answer 30

Basic data types provided by programming languages, such as integers, floating-point numbers, booleans, and characters. They represent simple values and have predefined characteristics.

Question 31

Reference Data Type

Answer 31

A data type that refers to an object in memory rather than directly storing the value. It stores the memory address where the object is located.

Question 32

Zero-indexed language

Answer 32

In computer programming, this refers to systems where counting starts from 0 instead of 1 when accessing elements in an ordered collection (e.g., arrays).

Question 33

import java.util.Arrays;

Answer 33

A statement in Java that allows you to access the functionality of the Arrays class from the java.util package. It is used to import specific classes or entire packages into your program.

Question 34

array.length

Answer 34

This property is an array refers to the number of elements it contains.

Question 35

Limited Traversal

Answer 35

Refers to the process of accessing only a portion of a data structure, such as an array or list, instead of traversing through the entire structure. It allows for efficient retrieval and manipulation of specific elements within the data structure.

Question 36

Reverse Traversal

Answer 36

Accessing elements in reverse order, starting from the last element and moving towards the first element in a collection or data structure.

Question 37

Subsection

Answer 37

A smaller part or division of a larger section. In programming, it refers to breaking down a complex problem into smaller, more manageable parts.

Question 38

Traversing

Answer 38

Refers to the process of accessing each element in a data structure, such as an array or linked list, and performing some operation on it.

Question 39

while loop

Answer 39

A control flow statement that allows a block of code to be executed repeatedly as long as a specified condition is true.

Question 40

Enhanced For Loop

Answer 40

Also known as a foreach loop, it is a simplified way to iterate over elements in an array or collection. It automatically handles indexing and provides an easy way to access each element without explicitly using indices.

Question 41

Mutator Methods

Answer 41

Special types of methods in object-oriented programming that allow modification or mutation of an object’s attributes or properties.

Question 42

Pass-by-value

Answer 42

The method of passing arguments to functions or methods by creating copies of their values instead of directly passing references to them.

Question 43

Traverse

Answer 43

Refers to the process of accessing each element in a data structure (such as arrays or linked lists) one by one, usually for performing some operation on them.

Question 44

Algorithm

Answer 44

Step-by-step procedures or instructions designed to solve specific problems or perform specific tasks.

Question 45

Array

Answer 45

A fixed-size collection of elements of the same type stored in contiguous memory locations. It allows efficient access to individual elements using an index.

Question 46

duplicates

Answer 46

Elements or values that appear more than once in a collection, such as an array or list.

Question 47

evenFrequency

Answer 47

Refers to the occurrence of an element in a list or array that appears an equal number of times as other elements. In other words, every element with even frequency occurs the same number of times.

Question 48

isEven

Answer 48

A boolean function that determines whether a given number is divisible by 2 without leaving a remainder.

Question 49

Maximum

Answer 49

Refers to the largest value in a set of numbers or the highest point on a graph.

Question 50

mean

Answer 50

Mean, also known as average, is calculated by adding up all values in a set and dividing it by the total number of values.

Question 51

minValue

Answer 51

Refers to the smallest value in a set of numbers or data.

Question 52

returnAllConsecutiveSequences

Answer 52

A function that takes an array as input and returns all consecutive sequences (subarrays) within it.

Question 53

Reverse

Answer 53

To change the order of its characters, so that the last character becomes the first, the second-to-last becomes the second, and so on.

Question 54

shiftLeft

Answer 54

Shift left refers to moving all elements in a list or array towards the left by one position. The first element becomes the last element after shifting left.

Question 55

shiftRight

Answer 55

Shift right refers to moving all elements in a list or array towards the right by one position. The last element becomes the first element after shifting right.

Question 56

sum

Answer 56

Sum refers to the result obtained by adding two or more numbers together.

Question 57

Traversals

Answer 57

Traversals refer to the process of visiting and accessing each element in a data structure, such as a tree or graph, exactly once.