1. With recursion, the one thing you MUST have to prevent an infinite loop is:

a. You must have at least one base case

b. Need a while loop

c. No answer is correct

d. Function must call itself to be recursive

2. The Queens problem does not backtrack

True

False

3. Given: = | ,

What statement matches the above grammar

a. 8,8

b. 9,,9

c. No answer is correct

d. 99

4. Prefix would have the variables first then operation

True

False

5. A stack can be implemented by:

a. Array

b. All answers are correct

c. Linked list

d. STL