Question 1

What are the two base cases for a recursive binary search algorithm?

Accepted Answer

The two base cases are:
-first > last
-value == anArray[mid]
(where first is the index of the first item in the array,last is the index of the last item in the array,and mid is the midpoint of the array).

Question 2

The number of ways to choose k out of n things is ______.

Accepted Answer

A) the number of ways to choose k - 1 out of n - 1 things 
B) the number of ways to choose k out of n - 1 things 
C) the sum of the number of ways to choose k - 1 out of n - 1 things and the number of ways to choose k out of n - 1 things 
D) the product of the number of ways to choose k - 1 out of n - 1 things and the number of ways to choose k out of n - 1 things 
A) the number of ways to choose k - 1 out of n - 1 things 
B) the number of ways to choose k out of n - 1 things 
C) the sum of the number of ways to choose k - 1 out of n - 1 things and the number of ways to choose k out of n - 1 things 
D) the product of the number of ways to choose k - 1 out of n - 1 things and the number of ways to choose k out of n - 1 things C

Question 3

An iterative solution involves loops.

Accepted Answer

A) True 
 B)False  True

Question 4

The midpoint of a sorted array can be found by ______,where first is the index of the first item in the array and last is the index of the last item in the array.

Accepted Answer

A) first / 2 + last / 2 
B) first / 2 - last / 2 
C) (first + last)/ 2 
D) (first - last)/ 2 
A) first / 2 + last / 2 
B) first / 2 - last / 2 
C) (first + last)/ 2 
D) (first - last)/ 2

Question 5

What is the base case for the recursive solution to the Towers of Hanoi problem?

Accepted Answer

The base case for the recursiv

Question 6

When is the base case value == anArray[mid] (where mid is the midpoint of the array)reached in a recursive binary search algorithm?

Accepted Answer

This base case is re

Question 7

What is a pivot item?

Accepted Answer

A pivot item is an e

Question 8

An iterative method always calls itself.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following is a precondition for a method that accepts a number n and computes the nth Fibonacci number?

Accepted Answer

A) n is a negative integer 
B) n is a positive integer 
C) n is greater than 1 
D) n is an even integer 
A) n is a negative integer 
B) n is a positive integer 
C) n is greater than 1 
D) n is an even integer

Question 10

A recursive solution can have more than one base cases.

Accepted Answer

A) True 
 B)False

Question 11

A recursive binary search algorithm always reduces the problem size by ______ at each recursive call.

Accepted Answer

A) 1 
B) 2 
C) half 
D) one-third 
A) 1 
B) 2 
C) half 
D) one-third

Question 12

The factorial of n is equal to ______.

Accepted Answer

A) n - 1 
B) n - factorial (n-1) 
C) factorial (n-1) 
D) n * factorial (n-1) 
A) n - 1 
B) n - factorial (n-1) 
C) factorial (n-1) 
D) n * factorial (n-1)

Question 13

Which of the following is a base case for a recursive binary search algorithm? (first is the index of the first item in the array,last is the index of the last item in the array,and mid is the midpoint of the array).

Accepted Answer

A) last > first B) first > last C) 0 <= first D) last <= SIZE-1 A) last > first B) first > last C) 0 <= first D) last <= SIZE-1

Question 14

Suppose a program contains a recursive method findFibonacci(int n),which computes the n-th Fibonacci number.Even if we know that a client method will never call findFibonacci( )with the values 1 or 2 as arguments,why does the implementation of findFibonacci( )still need to have base cases?

Accepted Answer

In the course of findFibonacci's own rec

Question 15

In a recursive solution,the ______ terminates the recursive processing.

Accepted Answer

A) local environment 
B) pivot item 
C) base case 
D) recurrence relation 
A) local environment 
B) pivot item 
C) base case 
D) recurrence relation

Question 16

Why does the Fibonacci sequence have two base cases? In other words,would it be possible to write a correct recursive Fibonacci method that has only one base case?

Accepted Answer

We need two base cases,because if we don

Question 17

A recursive method that computes the number of groups of k out of n things has the precondition that ______.

Accepted Answer

A) n is a positive number and k is a nonnegative number 
B) n is a nonnegative number and k is a positive number 
C) n and k are nonnegative numbers 
D) n and k are positive numbers 
A) n is a positive number and k is a nonnegative number 
B) n is a nonnegative number and k is a positive number 
C) n and k are nonnegative numbers 
D) n and k are positive numbers

Question 18

In the recursive solution to the kth smallest item problem,the problem size decreases by ______ at each recursive call.

Accepted Answer

A) 1 
B) at least 1 
C) half 
D) at least half 
A) 1 
B) at least 1 
C) half 
D) at least half

Question 19

In the Fibonacci sequence,which of the following integers comes after the sequence 1,1,2,3?

Accepted Answer

A) 3 
B) 4 
C) 5 
D) 6 
A) 3 
B) 4 
C) 5 
D) 6

Question 20

What are the two factors which contribute to the inefficiency of some recursive solutions?

Accepted Answer

The two factors are the overhe

What are the two base cases for a recursive binary search algorithm?

The number of ways to choose k out of n things is ______.

An iterative solution involves loops.

The midpoint of a sorted array can be found by ______,where first is the index of the first item in the array and last is the index of the last item in the array.

What is the base case for the recursive solution to the Towers of Hanoi problem?

When is the base case value == anArray[mid] (where mid is the midpoint of the array)reached in a recursive binary search algorithm?

What is a pivot item?

An iterative method always calls itself.

Which of the following is a precondition for a method that accepts a number n and computes the nth Fibonacci number?

A recursive solution can have more than one base cases.

A recursive binary search algorithm always reduces the problem size by ______ at each recursive call.

The factorial of n is equal to ______.

Which of the following is a base case for a recursive binary search algorithm? (first is the index of the first item in the array,last is the index of the last item in the array,and mid is the midpoint of the array).

Suppose a program contains a recursive method findFibonacci(int n),which computes the n-th Fibonacci number.Even if we know that a client method will never call findFibonacci( )with the values 1 or 2 as arguments,why does the implementation of findFibonacci( )still need to have base cases?

In a recursive solution,the ______ terminates the recursive processing.

Why does the Fibonacci sequence have two base cases? In other words,would it be possible to write a correct recursive Fibonacci method that has only one base case?

A recursive method that computes the number of groups of k out of n things has the precondition that ______.

In the recursive solution to the kth smallest item problem,the problem size decreases by ______ at each recursive call.

In the Fibonacci sequence,which of the following integers comes after the sequence 1,1,2,3?

What are the two factors which contribute to the inefficiency of some recursive solutions?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 3: Recursion: the Mirrors

What are the two base cases for a recursive binary search algorithm?

The number of ways to choose k out of n things is ______.

An iterative solution involves loops.

The midpoint of a sorted array can be found by ______,where first is the index of the first item in the array and last is the index of the last item in the array.

What is the base case for the recursive solution to the Towers of Hanoi problem?

When is the base case value == anArray[mid] (where mid is the midpoint of the array)reached in a recursive binary search algorithm?

What is a pivot item?

An iterative method always calls itself.

Which of the following is a precondition for a method that accepts a number n and computes the nth Fibonacci number?

A recursive solution can have more than one base cases.

A recursive binary search algorithm always reduces the problem size by ______ at each recursive call.

The factorial of n is equal to ______.

Which of the following is a base case for a recursive binary search algorithm? (first is the index of the first item in the array,last is the index of the last item in the array,and mid is the midpoint of the array).

Suppose a program contains a recursive method findFibonacci(int n),which computes the n-th Fibonacci number.Even if we know that a client method will never call findFibonacci( )with the values 1 or 2 as arguments,why does the implementation of findFibonacci( )still need to have base cases?

In a recursive solution,the ______ terminates the recursive processing.

Why does the Fibonacci sequence have two base cases? In other words,would it be possible to write a correct recursive Fibonacci method that has only one base case?

A recursive method that computes the number of groups of k out of n things has the precondition that ______.

In the recursive solution to the kth smallest item problem,the problem size decreases by ______ at each recursive call.

In the Fibonacci sequence,which of the following integers comes after the sequence 1,1,2,3?

What are the two factors which contribute to the inefficiency of some recursive solutions?

Review of Java Fundamentals

Principles of Programming and Software Engineering

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters