Prerequisites: Discrete Mathematics (MATH 81) and Data
Structures (COMP 121)
Textbook:Introduction to Algorithms
by Cormen, Leiserson and Rivest. 1990, McGraw-Hill Publishing, Inc.
ISBN#0-07-013143-0.
Course Overview:
The goal of this class is to present fundamental problem-solving techniques,
for designing efficient computer algorithms, proving their correctness,
and analyzing their performance (e.g. running time, storage requirement, etc.).
We will study asymptotic complexity and mathematical analysis of algorithms,
design techniques, data structures, and possible applications.
The list of topics includes:
Each topic will be motivated by an interesting example, then studied
about its basic concepts and accompanied by analysis.
Lectures and Approximate Schedule
Here is a list of lecture topics (subject to
changes). Schedule and information on each topic (e.g. readings, web
pointers) will be added during the semester before each class.
Copyright 1999.
Personal use of this material is permitted. However, permission to
reprint/republish this material for advertising or promotional purposes
or for creating new collective works for resale or redistribution to servers or
lists, or to reuse any copyrighted component of this work in other works
must be obtained from the author.
This material is presented to ensure timely dissemination of scholarly
and technical work. Copyright and all rights therein are retained by authors or
by other copyright holders. All persons copying this information are
expected to adhere to the terms and constraints invoked by each author's
copyright. In most cases, these works may not be reposted without the
explicit permission of the copyright holder.
