Question 1

The operands of an operator are evaluated ________.

Accepted Answer

A)  from right to left. 
B)  from left to right. 
C)  at the same time. 
D)  in an order that is specific to each operator. 
A)  from right to left. 
B)  from left to right. 
C)  at the same time. 
D)  in an order that is specific to each operator. B

Question 2

After a fractal's pattern is applied several times, the shape of the fractal will generally become ________.

Accepted Answer

A)  disjointed and less detailed. 
B)  stabilized and more detailed. 
C)  identical to the original fractal. 
D)  None of the above. 
A)  disjointed and less detailed. 
B)  stabilized and more detailed. 
C)  identical to the original fractal. 
D)  None of the above. B

Question 3

Recursion is often less efficient than iteration because ________.

Accepted Answer

A)  it can cause an explosion of method calls. 
B)  it is not as intuitive. 
C)  recursive methods are harder to debug. 
D)  recursive methods take longer to program. 
A)  it can cause an explosion of method calls. 
B)  it is not as intuitive. 
C)  recursive methods are harder to debug. 
D)  recursive methods take longer to program. A

Question 4

A recursive method .

Accepted Answer

A)  is a method that calls itself. 
B)  can be called directly. 
C)  can be called indirectly through another method. 
D)  All of the above. 
A)  is a method that calls itself. 
B)  can be called directly. 
C)  can be called indirectly through another method. 
D)  All of the above.

Question 5

Each time a fractal's pattern is applied to it, the fractal is said to be at a new ________.

Accepted Answer

A)  level. 
B)  depth. 
C)  order. 
D)  All of the above. 
A)  level. 
B)  depth. 
C)  order. 
D)  All of the above.

Question 6

When a recursive method is called to solve a problem, the method actually is capable of solving only the simplest case(s), or_______ .

Accepted Answer

A)  base case(s). 
B)  base step(s). 
C)  recursive call(s). 
D)  recursion step(s). 
A)  base case(s). 
B)  base step(s). 
C)  recursive call(s). 
D)  recursion step(s).

Question 7

The recursion step should:

Accepted Answer

A)  check for the base case. 
B)  call a fresh copy of the recursive method to work on a smaller problem. 
C)  make two calls to the recursive method. 
D)  iterate until it reaches a termination condition. 
A)  check for the base case. 
B)  call a fresh copy of the recursive method to work on a smaller problem. 
C)  make two calls to the recursive method. 
D)  iterate until it reaches a termination condition.

Question 8

When the recursion step executes:

Accepted Answer

A)  this is known as indirect recursion. 
B)  all of the computer's processes halt until the recursion step has completed executing. 
C)  the original call to the method is still active. 
D)  All of the above. 
A)  this is known as indirect recursion. 
B)  all of the computer's processes halt until the recursion step has completed executing. 
C)  the original call to the method is still active. 
D)  All of the above.

Question 9

Fractals that yield an exact copy of the original when a portion of the original image is magnified are called___________________ fractals.

Accepted Answer

A)  strictly self-similar. 
B)  Koch Curve. 
C)  similar. 
D)  mirror. 
A)  strictly self-similar. 
B)  Koch Curve. 
C)  similar. 
D)  mirror.

Question 10

The current method executing is always the method whose activation record is ________.

Accepted Answer

A)  at the bottom of the stack. 
B)  at the top of the stack. 
C)  never placed on the stack. 
D)  second from the top of the stack, just below the previous method call. 
A)  at the bottom of the stack. 
B)  at the top of the stack. 
C)  never placed on the stack. 
D)  second from the top of the stack, just below the previous method call.

Question 11

In recursive backtracking, if one set of recursive calls does not result in a solution to the problem, what happens?

Accepted Answer

A)  The program returns to a previous decision point and makes a different decision. 
B)  The program backs up to the previous decision point and throws an exception. 
C)  The program continues, with unexpected results. 
D)  The program backs up to the original method call. 
A)  The program returns to a previous decision point and makes a different decision. 
B)  The program backs up to the previous decision point and throws an exception. 
C)  The program continues, with unexpected results. 
D)  The program backs up to the original method call.

Question 12

The number of calls to recursively calculate the Fibonacci value of 7 is:

Accepted Answer

A)  7 
B)  13 
C)  41 
D)  39 
A)  7 
B)  13 
C)  41 
D)  39

Question 13

All of the following are true for both recursion and iteration except ________.

Accepted Answer

A)  they have a base case. 
B)  they can cause infinite loops or infinite recursion. 
C)  they are based on a control statement. 
D)  both gradually approach termination. 
A)  they have a base case. 
B)  they can cause infinite loops or infinite recursion. 
C)  they are based on a control statement. 
D)  both gradually approach termination.

Question 14

Which of the following is false?

Accepted Answer

A)  Since BigInteger is not a primitive type, we can't use the arithmetic, relational and equality operators with BigIntegers. 
B)  BigInteger method compareTo compares the BigInteger number that calls the method to the method's BigInteger argument, and returns -1 if the BigInteger that calls the method is less than the argument, 0 if they're equal or 1 if the BigInteger that calls the method is greater than the argument. 
C)  The value 1 can be implicitly converted to a BigInteger. 
D)  BigInteger can represent integer values larger than what primitive type long can represent. 
A)  Since BigInteger is not a primitive type, we can't use the arithmetic, relational and equality operators with BigIntegers. 
B)  BigInteger method compareTo compares the BigInteger number that calls the method to the method's BigInteger argument, and returns -1 if the BigInteger that calls the method is less than the argument, 0 if they're equal or 1 if the BigInteger that calls the method is greater than the argument. 
C)  The value 1 can be implicitly converted to a BigInteger. 
D)  BigInteger can represent integer values larger than what primitive type long can represent.

Question 15

Recursion often is preferable to iteration because ________.

Accepted Answer

A)  it is faster. 
B)  it requires less memory. 
C)  it models the problem more logically. 
D)  All of the above. 
A)  it is faster. 
B)  it requires less memory. 
C)  it models the problem more logically. 
D)  All of the above.

Exam 18: Recursion

The operands of an operator are evaluated ________.

After a fractal's pattern is applied several times, the shape of the fractal will generally become ________.

Recursion is often less efficient than iteration because ________.

A recursive method .

Each time a fractal's pattern is applied to it, the fractal is said to be at a new ________.

When a recursive method is called to solve a problem, the method actually is capable of solving only the simplest case(s), or_______ .

The recursion step should:

When the recursion step executes:

Fractals that yield an exact copy of the original when a portion of the original image is magnified are called___________________ fractals.

The current method executing is always the method whose activation record is ________.

In recursive backtracking, if one set of recursive calls does not result in a solution to the problem, what happens?

The number of calls to recursively calculate the Fibonacci value of 7 is:

All of the following are true for both recursion and iteration except ________.

Which of the following is false?

Recursion often is preferable to iteration because ________.

Introduction to Computers, the Internet and Java

Introduction to Java Applications; Inputoutput and Operators

Introduction to Classes, Objects, Methods and Strings

Control Statements: Assignment, and Operators

Control Statements: Logical Operators

Methods: a Deeper Look

Arrays and Arraylists

Classes and Objects: a Deeper Look

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism and Interfaces

Exception Handling: a Deeper Look

Javafx Graphical User Interfaces

Javafx Gui

Strings, Characters and Regular Expressions

Files, Inputoutput Streams, Nio and Xml Serialization

Generic Collections

Lambdas and Streams

Searching, Sorting and Big O

Generic Classes and Methods: a Deeper Look

Custom Generic Data Structures

Concurrency

Accessing Databases With Jdbc

Swing Gui Components

Graphics and Java 2d

Networking

Java Persistence Api Jpa

Javaserver Faces Web Apps

Javaserver Faces Web Apps

Swing Gui Components

Filters