1. In many sequences, the value of the nth term is determined by an formula incorporating previous values in the sequences (some combination of previous terms). This is called a

a) recurrence relation

b) function on the terms

c) recursive algorithm

d) dependent sequence

2. For many problems we are concerned with the size of sets, called the cardinality. Two sets, A and B have the same cardinality if and only if

a) there is a function that is a surjection from A to B

b) there is a one-to-one correspondence from A to B

c) there is a one-to-one function from A to B

d) there is an onto function from A to B

3. A function is if there is a computer program in some programming language that finds the values of the function.

a) transitive

b) an algorithm

c) computable

d) solva