Question 1

On a computer, conditional recursion continues until all available memory is used, or until it triggers some time-out mechanism in the operating system.

Accepted Answer

A) True 
 B)False

Question 2

The pattern of seeds on the head of a sunflower, the geometry of a snail's shell, and even DNA gene sequencing all appear to be recursive structures.

Accepted Answer

A) True 
 B)False

Question 3

____ occurs when a method calls itself more than once in each pass through a method.

Accepted Answer

A)  Linear recursion 
B)  Iteration 
C)  Exponential recursion 
D)  Tail recursion 
A)  Linear recursion 
B)  Iteration 
C)  Exponential recursion 
D)  Tail recursion

Question 4

At each level of exponential recursion, the number of copies of the program ____.

Accepted Answer

A)  doubles 
B)  triples 
C)  quadruples 
D)  quintuples 
A)  doubles 
B)  triples 
C)  quadruples 
D)  quintuples

Question 5

Recursion that is not infinite is called ____.

Accepted Answer

A)  mutual recursion 
B)  conditional recursion 
C)  binary recursion 
D)  iteration 
A)  mutual recursion 
B)  conditional recursion 
C)  binary recursion 
D)  iteration

Question 6

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (b)?
Sailboat.sail to (target)
(a)
If ( not [sailboat is within 5 meters of target] )
{
Do together
{
Sailboat.turn to face target
Sailboat.move forward 2 meters
}
(b)
}
(c)

Accepted Answer

A)  sailboat.sail to (target) 
B)  Start 
C)  Do together 
D)  Stop 
A)  sailboat.sail to (target) 
B)  Start 
C)  Do together 
D)  Stop

Question 7

The following algorithm is an example of ____.
Begin with an equilateral triangle
Sierpinski (triangle)
Start
Find the midpoint of each side of the triangle
Draw lines connecting the midpoints, which will form four smaller triangles that can be called triangles A, B, C, and D, with D in the center and the others around it.
Color in (or cut out) the center triangle // triangle D
Do Sierpinski (triangle A)
Do Sierpinski (triangle B)
Do Sierpinski (triangle C)
Stop

Accepted Answer

A)  linear recursion 
B)  iteration 
C)  mutual recursion 
D)  infinite recursion 
A)  linear recursion 
B)  iteration 
C)  mutual recursion 
D)  infinite recursion

Question 8

A recursive algorithm usually contains a(n) ____ instruction that causes the algorithm to keep calling itself until the base condition is met.

Accepted Answer

A)  For 
B)  Stop 
C)  IF/ELSE 
D)  Start 
A)  For 
B)  Stop 
C)  IF/ELSE 
D)  Start

Question 9

An exponential recursion graph looks like a ____.

Accepted Answer

A)  polygon 
B)  straight line 
C)  circle 
D)  curve 
A)  polygon 
B)  straight line 
C)  circle 
D)  curve

Question 10

In computer programming, an algorithm that calls itself is said to be ____.

Accepted Answer

A)  iterative 
B)  recursive 
C)  cyclic 
D)  repetitive 
A)  iterative 
B)  recursive 
C)  cyclic 
D)  repetitive

Question 11

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (a)?
Sailboat.sail to (target)
(a)
If ( not [sailboat is within 5 meters of target] )
{
Do together
{
Sailboat.turn to face target
Sailboat.move forward 2 meters
}
(b)
}
(c)

Accepted Answer

A)  sailboat.sail to (target) 
B)  Start 
C)  Do together 
D)  Stop 
A)  sailboat.sail to (target) 
B)  Start 
C)  Do together 
D)  Stop

Question 12

The condition that stops the recursion is called the ____.

Accepted Answer

A)  end condition 
B)  stop order 
C)  end case 
D)  base condition 
A)  end condition 
B)  stop order 
C)  end case 
D)  base condition

Question 13

For simple tasks that can be described with linear recursion, iteration seems to be a better choice.

Accepted Answer

A) True 
 B)False

Question 14

Recursion can describe a very sophisticated process with a simple and efficient set of instructions.

Accepted Answer

A) True 
 B)False

Question 15

Blood vessels in the human body have a structure that can be best described by recursion.

Accepted Answer

A) True 
 B)False

Question 16

Even after taking into account the overhead, iterative algorithms are usually far more efficient than recursive solutions.

Accepted Answer

A) True 
 B)False

Question 17

For complex problems that can be broken down into smaller parts, linear recursion usually works much better.

Accepted Answer

A) True 
 B)False

Question 18

The pseudocode for an iterative method is shown below. What statement is missing from the area labeled (a)?
Sailboat.sail to (target)
(a) ( not [sailboat is within 5 meters of target] )
{
Do together
{
Sailboat.turn to face target
Sailboat.move forward 2 meters
}
}
(b)

Accepted Answer

A)  For 
B)  If 
C)  While 
D)  Stop 
A)  For 
B)  If 
C)  While 
D)  Stop

Question 19

____ occurs when a method calls itself only once each time through the method.

Accepted Answer

A)  Linear recursion 
B)  Infinite recursion 
C)  Exponential recursion 
D)  Mutual recursion 
A)  Linear recursion 
B)  Infinite recursion 
C)  Exponential recursion 
D)  Mutual recursion

Question 20

The marble floor of the Sistine Chapel has patterns in the tiles that is an example of a mathematical design called a Sierpinski gasket.

Accepted Answer

A) True 
 B)False

On a computer, conditional recursion continues until all available memory is used, or until it triggers some time-out mechanism in the operating system.

The pattern of seeds on the head of a sunflower, the geometry of a snail's shell, and even DNA gene sequencing all appear to be recursive structures.

____ occurs when a method calls itself more than once in each pass through a method.

At each level of exponential recursion, the number of copies of the program ____.

Recursion that is not infinite is called ____.

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (b)? Sailboat.sail to (target) (a) If ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } (b) } (c)

A recursive algorithm usually contains a(n) ____ instruction that causes the algorithm to keep calling itself until the base condition is met.

An exponential recursion graph looks like a ____.

In computer programming, an algorithm that calls itself is said to be ____.

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (a)? Sailboat.sail to (target) (a) If ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } (b) } (c)

The condition that stops the recursion is called the ____.

For simple tasks that can be described with linear recursion, iteration seems to be a better choice.

Recursion can describe a very sophisticated process with a simple and efficient set of instructions.

Blood vessels in the human body have a structure that can be best described by recursion.

Even after taking into account the overhead, iterative algorithms are usually far more efficient than recursive solutions.

For complex problems that can be broken down into smaller parts, linear recursion usually works much better.

The pseudocode for an iterative method is shown below. What statement is missing from the area labeled (a)? Sailboat.sail to (target) (a) ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } } (b)

____ occurs when a method calls itself only once each time through the method.

The marble floor of the Sistine Chapel has patterns in the tiles that is an example of a mathematical design called a Sierpinski gasket.

Making Animated Movies With Alice

Lists and Arrays in Alice

Text and Sound

Boolean Logic in Programming

Algorithms

Events

Methods

Video Game Programming

An Introduction to Alice and Object-Oriented Programming

Filters

Exam 7: Recursive Algorithms

On a computer, conditional recursion continues until all available memory is used, or until it triggers some time-out mechanism in the operating system.

The pattern of seeds on the head of a sunflower, the geometry of a snail's shell, and even DNA gene sequencing all appear to be recursive structures.

____ occurs when a method calls itself more than once in each pass through a method.

At each level of exponential recursion, the number of copies of the program ____.

Recursion that is not infinite is called ____.

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (b)? Sailboat.sail to (target) (a) If ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } (b) } (c)

A recursive algorithm usually contains a(n) ____ instruction that causes the algorithm to keep calling itself until the base condition is met.

An exponential recursion graph looks like a ____.

In computer programming, an algorithm that calls itself is said to be ____.

The pseudocode for a recursive method is shown below. What statement is missing from the area labeled (a)? Sailboat.sail to (target) (a) If ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } (b) } (c)

The condition that stops the recursion is called the ____.

For simple tasks that can be described with linear recursion, iteration seems to be a better choice.

Recursion can describe a very sophisticated process with a simple and efficient set of instructions.

Blood vessels in the human body have a structure that can be best described by recursion.

Even after taking into account the overhead, iterative algorithms are usually far more efficient than recursive solutions.

For complex problems that can be broken down into smaller parts, linear recursion usually works much better.

The pseudocode for an iterative method is shown below. What statement is missing from the area labeled (a)? Sailboat.sail to (target) (a) ( not [sailboat is within 5 meters of target] ) { Do together { Sailboat.turn to face target Sailboat.move forward 2 meters } } (b)

____ occurs when a method calls itself only once each time through the method.

The marble floor of the Sistine Chapel has patterns in the tiles that is an example of a mathematical design called a Sierpinski gasket.

Making Animated Movies With Alice

Lists and Arrays in Alice

Text and Sound

Boolean Logic in Programming

Algorithms

Events

Methods

Video Game Programming

An Introduction to Alice and Object-Oriented Programming

Filters