Syllabus for CS 483

      Section 2
   Spring 2002

Class Hours:    Wednesday 17:20 - 22:00 Robinson B228

Instructor:     Kenneth De Jong

Office Hours:   Wednesday, 3:00 - 4:00     Rm 419 Science & Tech II
Phone:          703-993-1553
Email:          kdejong@gmu.edu

Course Text:    Introduction to Algorithms, Second Edition
                    by T. Cormen et al., McGraw-Hill, 2001

Prerequisites:  Students must have taken CS 310, 330 and Math 114 and
                received a grade of C or better in each one. In addition, 
                general computer science maturity is assumed and used 
                throughout the course, including a working knowledge of 
                computer systems and several programming languages.

Content:        This course examines the design and analysis of computer
                algorithms.  Topics include: advanced data structures and 
                their implementation; measures of time and space complexity; 
                analysis of algorithms for internal and external searching, 
                sorting, and merging; graph algorithms; dynamic programming;
                and an introduction to computational complexity.

Homework:       There will be homework assignments of a mathematical
                nature involving analysis of algorithms and derivations
                of proofs.  There will also be programming assignments 
                which will include written reports.

Exams:         There will be a midterm and final exam.

Grading:        The course grade will be determined approximately as
                follows:

                        homework:       40%
                        midterm:        25%
                        final:          35%