Final: Coverage

· Next Monday (12/9)

· Open book: focus on understanding!

o OK to consult your own notes on devices

o ABSOLUTELY no on-line access. BE HONEST!

Coverage: (including all materials)

· Textbook:

o Chapter 11: We did not cover Radix sort

o Chapter 15: We did not cover Binary Search Sort sufficiently

· Lecture notes: including all materials from before Mid-Term-I

o Lecture 12 to 15.

o Sorting: Pay attention to merge and quick sorts

o Numbers: able to convert to and from bases 2 to 16.

o Propositions: truth table for up to 3 variables

§ Don't worry about Quantifiers and Proofs.

o Trees: definitions and terms

§ Pre, in, post order traversals of binary trees

· Binary Search Trees: not covered

· Programming assignment: HW7 array representation of link lists and memory management.