CSE 373 Midterm Exam Topics (Autumn 2006)
- Sets, binary relations, cartesian products,
properties of binary relations, functions, properties of functions.
- logarithms and exponents, the number of
bits required to distinguish one element of a set.
- Growth rates, big O, big Omega, big Theta
- Proof by induction.
- Functional notation for abstract data types.
- Stacks and queues.
- Infix and postfix expressions. Converting and
evaluating expressions.
- Free trees. Rooted, ordered trees.
- Binary trees, binary search trees.
- AVL trees.
- Splay trees.