Chapter 6: Induction and Recursion Flashcards

1
Q

A special type of function in which the domain is a set of consecutive intergers.

A

Sequence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A sequence of real numbers where each term after the initial term is found by taking the previous term and multiplying by a fixed number called the common ratio.

A

Geometric Sequence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

A sequence of real numbers where each term after the initial term is found by taking the previous term and adding a fixed number called the common difference.

A

Arithmetic Sequence

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A rule that defines a term as a function of previous terms in the sequence,

A

Recurrence Relation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

A system that changes over time.

A

Dynamical System

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

The value of the function is defined in terms of the output value of the function on smaller input values.

A

Recursive Definition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Process of computing the value of a function using the result of the function on smaller input values.

A

Recursion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Type of induction used to prove theorems about recursive defined sets that follows the structure of the recursive definition

A

Structural Induction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

An algorithm that calls itself.

A

Recursive Algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly