HOMEWORK NON-PROBLEM 11_95        INTRODUCTION TO Ada I     586.1

  PURPOSE:      To learn more about access types, balanced binary trees,
                writing and reading disk files,
                Ada 95 Libraries,
                Classes of types,
                Multiple and virtual inheritance,
                Tagged types if time,
                etc.


  PROBLEM:      No homework problem this lecture.
                It would have been to do a balanced binary tree and
                do name lookup from names typed in from the keyboard.


  OBSERVE:      These tree manipulation routines are messy if recursive
                procedures and functions are not used. These happen
                to be in the class of "simple" recursive routines that
                can be thoroughly tested to be sure they terminate.


  READING :     ISO 8652:1995  Annexe A, C, D, E, F, G, and H.
                These are the predefined libraries.

                Barnes   Ch 20, 22.


  Next week:    Quiz 2
                Open Book, Open Note, Take it home if you like.
                Do not use a computer to help you with the quiz.
                Do not get help from others on the quiz.
                Pick up quiz here from Effie, any time after Monday.
                You can use this room next Wednesday and do the quiz
                here to make sure you finish it.


  Reusable Ada: Math packages and many other packages, e.g. generic sort
                and search, trees, etc. are on ECLUS::SW$DISK:[REUSABLE_ADA...]
                Sub directories of special interest might be .MATH and .COMMON

                Complete programs, such as documentation generator, APFAT,
                are in other sub directories.