Question 1

A polymorphic reference can refer to different types of objects over time.

Accepted Answer

A) True 
 B)False

Question 2

Consider this statement: If you declare a (polymorphic) reference variable, v, to be of type Object, by saying: Object v; then v can refer to any kind of object without restriction. If "object" means an instance of the Object class, is this statement true? Why or why not? If "object" means any kind of Java data, is this statement true? Why or why not?

Accepted Answer

Java only supports single inheritance, w

Question 3

What are the main programming mechanisms that constitute object-oriented programming?

Accepted Answer

A)  encapsulation, inheritance, polymorphism 
B)  encapsulation, abstraction, inheritance 
C)  inheritance, polymorphism, recursion 
D)  polymorphism, recursion, abstaction 
E)  None of these 
A)  encapsulation, inheritance, polymorphism 
B)  encapsulation, abstraction, inheritance 
C)  inheritance, polymorphism, recursion 
D)  polymorphism, recursion, abstaction 
E)  None of these

Question 4

Which of the following is true about a comparison between the selection sort and the insertion sort?

Accepted Answer

A)  The selection sort requires more additional memory than the insertion sort. 
B)  The insertion sort requires more additional memory than the selection sort. 
C)  Both methods require approximately the same amount of additional memory as the data they are sorting. 
D)  Neither method requires additional memory. 
E)  None of these 
A)  The selection sort requires more additional memory than the insertion sort. 
B)  The insertion sort requires more additional memory than the selection sort. 
C)  Both methods require approximately the same amount of additional memory as the data they are sorting. 
D)  Neither method requires additional memory. 
E)  None of these

Question 5

Code Example Ch 10-1
An int array stores the following values:
 $$\begin{array} { | l | l | l | l | l | l | l | } 
\hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \
\hline
\end{array}$$
-Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the fourth pass of the selection sort algorithm?

Accepted Answer

A)  9, 4, 12, 2, 6, 8, 18 
B)  2, 4, 6, 9, 12, 8, 18 
C)  2, 4, 6, 8, 9, 12, 18 
D)  2, 4, 6, 9, 8, 12, 18 
E)  2, 4, 6, 8, 12, 9, 18 
A)  9, 4, 12, 2, 6, 8, 18 
B)  2, 4, 6, 9, 12, 8, 18 
C)  2, 4, 6, 8, 9, 12, 18 
D)  2, 4, 6, 9, 8, 12, 18 
E)  2, 4, 6, 8, 12, 9, 18

Question 6

Explain how to alter the selection sort algorithm so that it sorts in descending order instead of ascending order.

Accepted Answer

The inner loop of the selection sort sea

Question 7

Demonstrate how the following array is sorted using insertion sort. Show the array after each pass of the outer loop.
[16, 3, 12, 13, 8, 1, 18, 9]

Accepted Answer

16, 3, 12, 13, 8, 1, 18, 9 (initial)
3,

Question 8

The binary search can be used on unsorted data. It will just perform more slowly.

Accepted Answer

A) True 
 B)False

Question 9

An class reference can refer to any object of any class that descends from the class.

Accepted Answer

A) True 
 B)False

Question 10

Although insertion sort and selection sort have generally the same performance, the selection sort has an advantage over the insertion sort. What is this advantage?

Accepted Answer

A)  The selection sort usually makes fewer comparisons. 
B)  The selection sort usually makes fewer swaps. 
C)  The selection sort usually makes fewer passes. 
D)  The selection sort usually makes fewer selections. 
E)  None of these 
A)  The selection sort usually makes fewer comparisons. 
B)  The selection sort usually makes fewer swaps. 
C)  The selection sort usually makes fewer passes. 
D)  The selection sort usually makes fewer selections. 
E)  None of these

Question 11

An interface reference can refer to any object of any class that implements the interface.

Accepted Answer

A) True 
 B)False

Question 12

Code Example Ch 10-1
An int array stores the following values:
 $$\begin{array} { | l | l | l | l | l | l | l | } 
\hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \
\hline
\end{array}$$
-Refer to Code Example Ch 10-1: How many passes will it take in total for the selection sort to sort this array?

Accepted Answer

A)  2 
B)  4 
C)  5 
D)  6 
E)  7 
A)  2 
B)  4 
C)  5 
D)  6 
E)  7

Question 13

Given the following code, class Aggregate is incorrect. Choose the correct line so that this program prints: Granite: weight=25.0 value=4 numKind=7 public class Inherit
{
Abstract class Stone
{
Protected float weight = 13;
Protected int value = 4;
Abstract public String toString( );
}
Class Aggregate
{
Protected int numKind;
}
Class Granite extends Aggregate
{
Granite()
{
Weight = 25; numKind = 7;
}
Public String toString()
{
Return "Granite: weight="
+ weight + " value="
+ value + " numKind="
+ numKind;
}
}
Inherit()
{
Granite g = new Granite( );
System.out.println(g);
}
Public static void main(String[] args)
{
New Inherit();
}
}

Accepted Answer

A)  abstract class Aggregate { 
B)  abstract class Aggregate extends Granite { 
C)  abstract class Aggregate extends Stone { 
D)  class Aggregate extends Stone { 
E)  None of these 
A)  abstract class Aggregate { 
B)  abstract class Aggregate extends Granite { 
C)  abstract class Aggregate extends Stone { 
D)  class Aggregate extends Stone { 
E)  None of these

Question 14

A method's parameter can be polymorphic, giving the method flexible control of its arguments.

Accepted Answer

A) True 
 B)False

Question 15

What does the following code do? Assume list is an array of int values, temp is some previously initialized int value, and c is an int initialized to 0. for (j = 0; j < list.length; j++)
If (list[j] < temp) c++;

Accepted Answer

A)  It finds the smallest value and stores it in temp. 
B)  It finds the largest value and stores it in temp. 
C)  It counts the number of elements equal to the smallest value in list. 
D)  It counts the number of elements in list that are less than temp. 
E)  It sorts the values in list to be in ascending order. 
A)  It finds the smallest value and stores it in temp. 
B)  It finds the largest value and stores it in temp. 
C)  It counts the number of elements equal to the smallest value in list. 
D)  It counts the number of elements in list that are less than temp. 
E)  It sorts the values in list to be in ascending order.

Question 16

It is possible to sort an array of int, float, double or String, but not an array of an Object class such as a CD class.

Accepted Answer

A) True 
 B)False

Question 17

In order to determine the type that a polymorphic variable refers to, the decision is made

Accepted Answer

A)  by the programmer at the time the program is written 
B)  by the compiler at compile time 
C)  by the operating system when the program is loaded into memory 
D)  by the Java run-time environment at run time 
E)  by the user at run time 
A)  by the programmer at the time the program is written 
B)  by the compiler at compile time 
C)  by the operating system when the program is loaded into memory 
D)  by the Java run-time environment at run time 
E)  by the user at run time

Question 18

To swap the 3rd and 4th elements in the int array values, you would do:
values[3] = values[4];
values[4] = values[3];

Accepted Answer

A) True 
 B)False

Question 19

Which of the following methods will sort an array of floats in ascending order?

Accepted Answer

A)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
{
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
}
} 
B)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
{
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
}
} 
D)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
} 
E)  None of these 
A)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
{
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
}
} 
B)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
{
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
}
} 
D)  void arrange(float[] ary)
{
For (int n = 0; n  ary[k])
Float x = ary[n];
Ary[n] = ary[k];
Ary[k] = x;
} 
E)  None of these

Question 20

Code Example Ch 10-1
An int array stores the following values:
 $$\begin{array} { | l | l | l | l | l | l | l | } 
\hline 9 & 4 & 12 & 2 & 6 & 8 & 18 \
\hline
\end{array}$$
-Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the second pass of the selection sort algorithm?

Accepted Answer

A)  9, 4, 12, 2, 6, 8, 18 
B)  2, 4, 9, 6, 12, 8, 18 
C)  2, 4, 12, 9, 6, 8, 18 
D)  2, 4, 6, 8, 9, 12, 18 
E)  2, 4, 9, 12, 6, 8, 18 
A)  9, 4, 12, 2, 6, 8, 18 
B)  2, 4, 9, 6, 12, 8, 18 
C)  2, 4, 12, 9, 6, 8, 18 
D)  2, 4, 6, 8, 9, 12, 18 
E)  2, 4, 9, 12, 6, 8, 18

A polymorphic reference can refer to different types of objects over time.

What are the main programming mechanisms that constitute object-oriented programming?

Which of the following is true about a comparison between the selection sort and the insertion sort?

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the fourth pass of the selection sort algorithm?

Explain how to alter the selection sort algorithm so that it sorts in descending order instead of ascending order.

Demonstrate how the following array is sorted using insertion sort. Show the array after each pass of the outer loop. [16, 3, 12, 13, 8, 1, 18, 9]

The binary search can be used on unsorted data. It will just perform more slowly.

An class reference can refer to any object of any class that descends from the class.

Although insertion sort and selection sort have generally the same performance, the selection sort has an advantage over the insertion sort. What is this advantage?

An interface reference can refer to any object of any class that implements the interface.

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: How many passes will it take in total for the selection sort to sort this array?

A method's parameter can be polymorphic, giving the method flexible control of its arguments.

What does the following code do? Assume list is an array of int values, temp is some previously initialized int value, and c is an int initialized to 0. for (j = 0; j < list.length; j++) If (list[j] < temp) c++;

It is possible to sort an array of int, float, double or String, but not an array of an Object class such as a CD class.

In order to determine the type that a polymorphic variable refers to, the decision is made

To swap the 3rd and 4th elements in the int array values, you would do: values[3] = values[4]; values[4] = values[3];

Which of the following methods will sort an array of floats in ascending order?

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the second pass of the selection sort algorithm?

Introduction

Data and Expressions

Using Classes and Objects

Writing Classes

Conditionals and Loops

More Conditionals and Loops

Object-Oriented Design

Arrays

Inheritance

Exceptions

Recursion

Collections

Filters

Exam 10: Polymorphism

A polymorphic reference can refer to different types of objects over time.

What are the main programming mechanisms that constitute object-oriented programming?

Which of the following is true about a comparison between the selection sort and the insertion sort?

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the fourth pass of the selection sort algorithm?

Explain how to alter the selection sort algorithm so that it sorts in descending order instead of ascending order.

Demonstrate how the following array is sorted using insertion sort. Show the array after each pass of the outer loop. [16, 3, 12, 13, 8, 1, 18, 9]

The binary search can be used on unsorted data. It will just perform more slowly.

An class reference can refer to any object of any class that descends from the class.

Although insertion sort and selection sort have generally the same performance, the selection sort has an advantage over the insertion sort. What is this advantage?

An interface reference can refer to any object of any class that implements the interface.

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: How many passes will it take in total for the selection sort to sort this array?

A method's parameter can be polymorphic, giving the method flexible control of its arguments.

What does the following code do? Assume list is an array of int values, temp is some previously initialized int value, and c is an int initialized to 0. for (j = 0; j < list.length; j++) If (list[j] < temp) c++;

It is possible to sort an array of int, float, double or String, but not an array of an Object class such as a CD class.

In order to determine the type that a polymorphic variable refers to, the decision is made

To swap the 3rd and 4th elements in the int array values, you would do: values[3] = values[4]; values[4] = values[3];

Which of the following methods will sort an array of floats in ascending order?

Code Example Ch 10-1 An int array stores the following values: 9 4 12 2 6 8 18 -Refer to Code Example Ch 10-1: Which of the following lists of numbers would accurately show the array after the second pass of the selection sort algorithm?

Introduction

Data and Expressions

Using Classes and Objects

Writing Classes

Conditionals and Loops

More Conditionals and Loops

Object-Oriented Design

Arrays

Inheritance

Exceptions

Recursion

Collections

Filters