Due: Monday, April 8, 2002, at the beginning of class.
Reading in Lewis & Denenberg:
Section 1.1.
Section 1.2: Memory and Data, Notation for Programs, Abstract
Data Types. Skim Locatives, but we won't really need it until start
doing binary trees.
Section 1.3. Much of this should be review from
321.
Section 2.1.
Problems
Give one similarity and one difference between ADTs and the
objects of Object-Oriented Programming.
From Chapter 1:
11, 23, 31, 36a,b,e,f
For each part of problem 23,
remember to give the reason why: constant c and n_0. In problem 31,
give a mathematical definition. Note that for problem 36 you only
need to find Θ(n), the order of the function.