Re: Call Stacks and Sort Questions
Greg
> out the steps of recursion in a call stack?
You should not memorize this -- we will, not ask you to regurgitate
it. But, you really should understand it. If you don't a whole bunch
of different types of questions might bite you. Things like back-
tracking and flood-fill can be hard to explain -- and especially hard
to trace. You might also have undetected trouble with some of the
basics of stack operations -- and we will be asking you to make
creative use of stacks.
> Are there test questions that will make us choose between bubble, selection, and insertion?
You should understand the characteristics of these sorts. Where they
are good, where they are not. You should pay attention to any
surprising or interesting special cases. Again, you need to have
intuition about the sorts -- why and how they are as they are --
memorizing some table of comparative properties won't help.
Please use the staff-111@cs mailing list to ask the rest of your
questions about the details of course material. This forum is to
discuss the final exam, in particular. Your original post will be
deleted to remove the offending questions.