Submitted reading questions for 02/26/2014

CS 121B (CS1), Spring 2014

sid	q1	categ	annot
9927	what does the len() aspect of a recursion function mean?
9932	I am confused about how the recursion calls itself. Could you explain that?
9943	Should we be able to understand everything from the readings now? Because I feel that it is getting harder and harder to follow sometimes.
9947	Can you explain the "Stack Frames" section a little more?
9950	What does it mean to move towards the base case?
9951	What is an immutable data type?
9953	A function can cite itself?
9954	What is a stack frame?
9955	Can we go over how to do the problem in the text about rewriting a word backwards?
9956	When you are setting a base case how small is small enough of a problem to be solved directly?
9957	Is it possible that a recursive program could end up in a state that it could not be stopped, or does Python have handlers that check for that?
9958	Why is recursion useful?
9960	Could you program an infinite loop in Python using recursion and if you did so, what would happen?
9961	What is the purpose of len in active code 2? What does len stand for?
9962	what kind of problems would arise in programming with which we would use a recursion to solve?
9963	The chapter refers to the "discussion of stacks back in the previous chapter." The previous chapter (which we skipped) is about dictionaries and contains nothing about stacks. What is a stack?

(16 rows)

sid	otherqs	categ	annot

(0 rows)