Midterm Week 6 ~kschmidt/public_html/CS260/StudyGuides/mid.html
Final Finals' week ~kschmidt/public_html/CS260/StudyGuides/final.html

* But, you can't forget the material from the first 5 weeks. Data structures are built off smaller data structures. E.g., we use lists, dictionaries, and priority queues, as well as linked structures, when traversing graphs.

Use your favorite programming language, psuedo-code, whatever, just you so that can get your thoughts across clearly, that I understand that you understand what you're talking about. An elegant (and concise) flowchart will get you more points than a crappy C function that happens to compile.

Do not memorise code; just algorithms, operations, properties of data structures. You'll be asked to think, to apply (and adapt) these things you've learned to other (maybe bigger) problems.

You will need to analyze space and time complexity of solutions you come up with.