True/False Questions

4. An infinite recursion in Python will hang the computer.

5. A sequence can be viewed as a recursive data collection.

8. A looping implementation of an algorithm is generally a bit faster than a recursive version.

9. Recursive algorithms tend to be slow in practice.

Multiple Choice

5. How much more memory does a simple linked implementation of a list require compared to an array-based list?

a) they require the same amount

b) only extra memory for each instance variable such as head

c) extra memory for each instance variable plus 4 bytes on 32-bit system for each item in the list to hold the reference to the next node

d) twice as much memory