Date: Thu, 29 Nov 2007 15:38:13 -0600 (CST)
   From: Mark Jacobson <jacobson@math-cs.cns.uni.edu>
     To: 810-080-02-fall@uni.edu
Subject: HW is outside office door - ITT 307 - Discrete

Hi 080 students,

      In case you missed class today, a handout of the HW that is due
on Tuesday is taped to the window just outside of my office door.
My office is right next to the CS department office and is 307 ITT.

      If you have any questions about the expression trees or anything
on the hashing or binary search trees, let me know.

      Page 594 and page 595

      3, 6B, 6D, 9, 11, 17D, 17E from the textbook.

           For 17E, carefully explain the formula too.

      Problem #19 is on the web page.  It is due with your HW.

      19.    http://cns2.uni.edu/~jacobson/080/hashingAssign.gif

             Label your answers 19a, 19b, and 19c for the n mod 17,
                                                          n mod 13 and
                                                          n mod 11
                                                          sections.

      The last problem, lets call it problem #21 to give it a number,
          is this one from the handout:

      21. What binary search tree (BST) produced the following traversals?

            PREORDER: N A H E P T R S
             INORDER: A E H N P R S T

           Draw the binary search tree and calculate its
                   average successful search performance.

      Mark