1. A stack is a FIFO

True

False

2. The stack operation that would remove the top of the stack is:

a. push(x)

b. pop()

c. No answer is correct

d. peek()

3. Can use recursion to convert an infix expression into a postfix expression

True

False

4. To prevent going in circles with the HPAir map

a. Don't backtrack

b. Mark a city as visited

c. No answer is correct

d. Only go 6 deep in the stack

5. You can use stacks explicitly

True

False