CSc 4520/6520 DESIGN AND ANALYSIS: ALGORITHMS Fall 2006

Computer Number 10597/10606

TT 1:00pm - 2:40pm  auditorium ALC304

Instructor:   Dr. Alex Zelikovsky

                   Office: 1443, Peachtree Str. 34

                   Phone: (404) 413 5730

                   Fax: (404) 413-5717

                   Email: alexz@cs.gsu.edu

                   Web site: http://www.cs.gsu.edu/~cscazz

Office Hours: TT 12:00pm –12:55pm (except meetings), and others by appointment

Text:
- T. H. Cormen, C. E. Leiserson and R. L. Rivest "Introduction to Algorithms" MIT Press, 1989 (and later editions)
- Manber, Introduction to Algorithms, a Creative Approach, Addison-Wesley ( optional).

Course Content:
- General algorithmic paradigms: divide and conquer, greedy algorithms, dynamic programming.
- Sorting and order statistics: merge-sort, quicksort, heapsort;
- Data structures: binary heaps, priority queues, binary search trees;
- Graph algorithms: BFS/DFS, MST, topological sort, shortest paths;
- Computational Geometry: sweep-Line, convex hull, closest pair, voronoi diagrams/Delanau triangulation

- NP-completeness and approximation algorithms for combinatorial problems:

       -  independent set, clique, vertex cover, TSP, Steiner tree, set cover 

- Additional topics: Stable matching, Linear programming, FFT.

Prerequisite: CSc 2010.

Withdrawals: The last day of regular withdrawal.

Course Requirements: Students should attend all classes, regularly complete all outside reading, project and other assignments.

Course Grades:
CSc 4520 - Homework/program assignments - 30%, Quizzes 30%, final 40%
CSc 6520 - Homework/program assignments - 30%, Quizzes 30%, project 40%

Other Policy:
Make-up's or missed deadlines must be arranged prior, and will be allowed only at the discretion of the instructor.
Any material submitted for the grade should be the student's own work.
Collaboration is allowed prior to preparation of actual material that will be submitted for the grade.