Nick Ruozzi

nrr4@cs.cornell.edu

Office Hours: Sun. 4:30PM - 7:00PM in Upson 360

Alvin Law

ajl56@cornell.edu

Office Hours: Wed.7:00-8:00PM in Upson 360 or by appointment

Prelim 2

Suggestions for how to do well on this exam:

Practice writing basic tree and heap manipulations so that you are comfortable with them for the exam. Also, think about what kind of code would be involved in a hash table question. Write some sample code that uses a stack or a queue to compute something.

Review Big-Oh notation and the running times of the searching and sorting algorithms.

What is the difference between dynamic and static binding, when is each used? Practice inheritance questions! Wrtie your own and try to figure out what will happen.

Do all of the practice exams (without looking at the answers first).

Generic Programming

Be sure to know the Iterator and Comparable interfaces (which were covered in section) for Prelim 2

Examples of Inner and Annonymous classes can be found in the general section notes and should be helpful for assignment 6

Notes from the exceptions lecture

Trees

a little test file for some of the methods in the notes

Wrappers, Strings, and Arrays vs. Vectors

Week 3

Recursion Notes

- I added an example of converting a non-tail recursive function to a tail recursive one

- Also, function removeDuplicates was slightlty incorrect when presented in class since charAt(1) will fail if the string is not at least of length 1

(for parsing information, see the lecture notes)

Induction Notes

CS211In Notes