Texts:          K. P. Bogart, Discrete Mathematics, D. C. Heath & 
                    Company, Lexington, MA, Latest Edition

                    L. A. Piegl, Discrete Structures, Lecture Notes,
                    Pro-Copy


    Time & Place:   TR 2:00-3:15 pm, BSF 100


    Professor:      Dr. Les A. Piegl, Professor, ENB 331, 974-5234
                    piegl@grad.csee.usf.edu
                    Office Hours: TR 9:00-11:00 am
    

    Goals:          To obtain an understanding of basic concepts of 
                    discrete mathematics essential in computer 
                    science
    

    Prerequisites:  Basics of mathematical analysis and algebra


    Topics:         Sets and statements
                    Symbolic logic
                    Relations
                    Functions
                    Proofs
                    Mathematical induction
                    Counting techniques
                    Recurrence relations
                    Trees and spanning trees
                    Basic graph theory  


    Grading:        Three tests: 100%


    Test Dates:     February 6, 2001
                    March 20, 2001
                    April 24, 2001