Question 1

Java does not limit the number of dimensions that an array may have.

Accepted Answer

A) True 
 B)False  True

Question 2

What is the value of scores[2][3] in the following array? int [] [] scores = { {88, 80, 79, 92}, {75, 84, 93, 80},
{98, 95, 92, 94}, {91, 84, 88, 96} };

Accepted Answer

A)  94 
B)  84 
C)  93 
D)  95 
A)  94 
B)  84 
C)  93 
D)  95 A

Question 3

What would be the results of the following code? int[] x = { 55, 33, 88, 22, 99,
11, 44, 66, 77 };
Int a = 10;
If(x[2] > x[5])
A = 5;
Else
A = 8;

Accepted Answer

A)  a = 5 
B)  a = 8 
C)  a = 10 
D)  This is a compilation error, you cannot compare array elements 
A)  a = 5 
B)  a = 8 
C)  a = 10 
D)  This is a compilation error, you cannot compare array elements A

Question 4

When an array is passed to a method:

Accepted Answer

A)  a reference to the array is passed 
B)  it is passed just as an object 
C)  the method has direct access to the original array 
D)  All of the above 
A)  a reference to the array is passed 
B)  it is passed just as an object 
C)  the method has direct access to the original array 
D)  All of the above

Question 5

When an individual element of an array is passed to a method:

Accepted Answer

A)  a reference to the array is passed 
B)  it is passed like any other variable 
C)  the method does not have direct access to the original array 
D)  All of the above 
A)  a reference to the array is passed 
B)  it is passed like any other variable 
C)  the method does not have direct access to the original array 
D)  All of the above

Question 6

You use this method to determine the number of items stored in an ArrayList object.

Accepted Answer

A)  numberItems 
B)  capacity 
C)  size 
D)  items 
A)  numberItems 
B)  capacity 
C)  size 
D)  items

Question 7

Objects in an array are accessed with subscripts, just like any other data type in an array.

Accepted Answer

A) True 
 B)False

Question 8

If a[] and b[] are two integer arrays, the expression a == b compares the array contents.

Accepted Answer

A) True 
 B)False

Question 9

By default, Java initializes array elements with what value?

Accepted Answer

A)  0 
B)  100 
C)  1 
D)  -1 
A)  0 
B)  100 
C)  1 
D)  -1

Question 10

The binary search algorithm:

Accepted Answer

A)  is less efficient than the sequential search algorithm 
B)  will cut the portion of the array being searched in half each time the loop fails to locate the search value 
C)  will have a maximum number of comparisons equal to the number of elements in the array 
D)  will have an average of N/2 comparisons, where N is the number of elements in the array 
A)  is less efficient than the sequential search algorithm 
B)  will cut the portion of the array being searched in half each time the loop fails to locate the search value 
C)  will have a maximum number of comparisons equal to the number of elements in the array 
D)  will have an average of N/2 comparisons, where N is the number of elements in the array

Question 11

What does the following statement do? double[] array1 = new double[10];

Accepted Answer

A)  Declares array1 to be a reference to an array of double values 
B)  Creates an instance of an array of 10 double values 
C)  Will allow valid subscripts in the range of 0 - 9 
D)  All of the above 
A)  Declares array1 to be a reference to an array of double values 
B)  Creates an instance of an array of 10 double values 
C)  Will allow valid subscripts in the range of 0 - 9 
D)  All of the above

Question 12

It is common practice to use a ____________ variable as a size declarator.

Accepted Answer

A)  static 
B)  reference 
C)  final 
D)  boolean 
A)  static 
B)  reference 
C)  final 
D)  boolean

Question 13

If final int SIZE = 15 and int[] x = new int[SIZE], what would be the range of subscript values that could be used with x[]?

Accepted Answer

A)  1 through 15 
B)  1 through 14 
C)  0 through 14 
D)  0 through 15 
A)  1 through 15 
B)  1 through 14 
C)  0 through 14 
D)  0 through 15

Question 14

A sorting algorithm is a technique for scanning through an array and rearranging its contents in some specific order.

Accepted Answer

A) True 
 B)False

Question 15

What would be the results of the following code? final int SIZE = 25;
Int[] array1 = new int[SIZE];
… // Code that will put values in array1
Int value = 0;
For (int a = 0; a < array1.length; a++)
{
Value += array1[a];
}

Accepted Answer

A)  value contains the highest value in array1 
B)  value contains the lowest value in array1 
C)  value contains the sum of all the values in array1 
D)  This would cause the program to crash 
A)  value contains the highest value in array1 
B)  value contains the lowest value in array1 
C)  value contains the sum of all the values in array1 
D)  This would cause the program to crash

Question 16

What would be the results after the following code was executed? int[] x = {23, 55, 83, 19};
Int[] y = {36, 78, 12, 24};
For(int a = 0; a < x.length; a++)
{
X[a] = y[a];
Y[a] = x[a];
}

Accepted Answer

A)  x[] = {36, 78, 12, 24} and y[] = {23, 55, 83, 19} 
B)  x[] = {36, 78, 12, 24} and y[] = {36, 78, 12, 24} 
C)  x[] = {23, 55, 83, 19} and y[] = {23, 55, 83, 19} 
D)  This is a compilation error 
A)  x[] = {36, 78, 12, 24} and y[] = {23, 55, 83, 19} 
B)  x[] = {36, 78, 12, 24} and y[] = {36, 78, 12, 24} 
C)  x[] = {23, 55, 83, 19} and y[] = {23, 55, 83, 19} 
D)  This is a compilation error

Question 17

A ragged array is:

Accepted Answer

A)  a two-dimensional array for which the number of rows is unknown 
B)  a one-dimensional array for which the number of elements is unknown 
C)  a two-dimensional array where the rows are of different lengths 
D)  There is no such thing as a ragged array 
A)  a two-dimensional array for which the number of rows is unknown 
B)  a one-dimensional array for which the number of elements is unknown 
C)  a two-dimensional array where the rows are of different lengths 
D)  There is no such thing as a ragged array

Question 18

Java limits the number of dimensions that an array may have to 15.

Accepted Answer

A) True 
 B)False

Question 19

This indicates the number of elements, or values, the array can hold.

Accepted Answer

A)  the new operator 
B)  the array's size declarator 
C)  the array's data type 
D)  the version of Java 
A)  the new operator 
B)  the array's size declarator 
C)  the array's data type 
D)  the version of Java

Question 20

In order to do a binary search on an array,

Accepted Answer

A)  the values of the array must be numeric 
B)  the array must first be sorted in ascending order 
C)  you must first do a sequential search of the array to assure the element you are looking for is there 
D)  There are no requirements 
A)  the values of the array must be numeric 
B)  the array must first be sorted in ascending order 
C)  you must first do a sequential search of the array to assure the element you are looking for is there 
D)  There are no requirements

Java does not limit the number of dimensions that an array may have.

What is the value of scores[2][3] in the following array? int [] [] scores = { {88, 80, 79, 92}, {75, 84, 93, 80}, {98, 95, 92, 94}, {91, 84, 88, 96} };

What would be the results of the following code? int[] x = { 55, 33, 88, 22, 99, 11, 44, 66, 77 }; Int a = 10; If(x[2] > x[5]) A = 5; Else A = 8;

When an array is passed to a method:

When an individual element of an array is passed to a method:

You use this method to determine the number of items stored in an ArrayList object.

Objects in an array are accessed with subscripts, just like any other data type in an array.

If a[] and b[] are two integer arrays, the expression a == b compares the array contents.

By default, Java initializes array elements with what value?

The binary search algorithm:

What does the following statement do? double[] array1 = new double[10];

It is common practice to use a ____________ variable as a size declarator.

If final int SIZE = 15 and int[] x = new int[SIZE], what would be the range of subscript values that could be used with x[]?

A sorting algorithm is a technique for scanning through an array and rearranging its contents in some specific order.

What would be the results of the following code? final int SIZE = 25; Int[] array1 = new int[SIZE]; … // Code that will put values in array1 Int value = 0; For (int a = 0; a < array1.length; a++) { Value += array1[a]; }

What would be the results after the following code was executed? int[] x = {23, 55, 83, 19}; Int[] y = {36, 78, 12, 24}; For(int a = 0; a < x.length; a++) { X[a] = y[a]; Y[a] = x[a]; }

A ragged array is:

Java limits the number of dimensions that an array may have to 15.

This indicates the number of elements, or values, the array can hold.

In order to do a binary search on an array,

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File IO

A First Look at GUI Applications

Advanced GUI Applications

Applets and More

Creating GUI Applications With Javafx and Scene Builder

Recursion

Databases

Filters

Exam 7: Arrays and the Arraylist Class

Java does not limit the number of dimensions that an array may have.

What is the value of scores[2][3] in the following array? int [] [] scores = { {88, 80, 79, 92}, {75, 84, 93, 80}, {98, 95, 92, 94}, {91, 84, 88, 96} };

What would be the results of the following code? int[] x = { 55, 33, 88, 22, 99, 11, 44, 66, 77 }; Int a = 10; If(x[2] > x[5]) A = 5; Else A = 8;

When an array is passed to a method:

When an individual element of an array is passed to a method:

You use this method to determine the number of items stored in an ArrayList object.

Objects in an array are accessed with subscripts, just like any other data type in an array.

If a[] and b[] are two integer arrays, the expression a == b compares the array contents.

By default, Java initializes array elements with what value?

The binary search algorithm:

What does the following statement do? double[] array1 = new double[10];

It is common practice to use a ____________ variable as a size declarator.

If final int SIZE = 15 and int[] x = new int[SIZE], what would be the range of subscript values that could be used with x[]?

A sorting algorithm is a technique for scanning through an array and rearranging its contents in some specific order.

What would be the results of the following code? final int SIZE = 25; Int[] array1 = new int[SIZE]; … // Code that will put values in array1 Int value = 0; For (int a = 0; a < array1.length; a++) { Value += array1[a]; }

What would be the results after the following code was executed? int[] x = {23, 55, 83, 19}; Int[] y = {36, 78, 12, 24}; For(int a = 0; a < x.length; a++) { X[a] = y[a]; Y[a] = x[a]; }

A ragged array is:

Java limits the number of dimensions that an array may have to 15.

This indicates the number of elements, or values, the array can hold.

In order to do a binary search on an array,

Introduction to Computers and Java

Java Fundamentals

Decision Structures

Loops and Files

Methods

A First Look at Classes

A Second Look at Classes and Objects

Text Processing and More About Wrapper Classes

Inheritance

Exceptions and Advanced File IO

A First Look at GUI Applications

Advanced GUI Applications

Applets and More

Creating GUI Applications With Javafx and Scene Builder

Recursion

Databases

Filters