Hey all, Just a quick clarification of scope. Please only use this group to discuss the final exam.

> Should we basically expect questions on all types of searches and > sorts covered in the

Yes and no. This question form, in general is very good. But, there are two things about it that

What seems vague? I'm happy to provide more detail. Honestly, I can't think of a better way

Hey, I'll try to get it posted to the course web page by mid-day tomorrow. I need to get it in

You should be very familiar with the properties of each of thes data structures. You should have a

You should be very familiar with the properties of linked lists and how to manipulate them -- moth at

> So basically we don't have to know about the best case or the > "average" case

The postfix/infix questions are good examples. But, they are just examples. If they were used on the

Hi Duncan, Any manipulation that tests your prowess at manipulating the nodes of a list is fair game.

Hey, These techniques are fair game in that they are good ways of exercising important data

Hi Duncan, Good question! This is unlikely. The reason is that there isn't a whole lot of utility

> Are we going to be given code snippets such as for searches/ sorts and > ask how they can be

> 1.Will we need to specifically explain how a call stack works and list > out the steps of

> I was wondering if the recursion portion of the exam is like those > problems or more like