Course Description

 In this course we will go through different paradigms for algorithm design such
as divide-and-conquer, prune-and-search, dynamic progamming, greedy strategy
and different analysis techniques with different data structures. We will apply
these design and analysis techniques to develop efficient graph and
geometric algorithms.

Book

 Introduction to Algorithms (2nd edition) by T. H. Cormen, C. E. Leiserson, R. Rivest, and C. Stein.
MIT press, McGraw-Hill book company.

Class Schedule

Meeting

DL 357 8:30-9:18
Office: DL483
Phone:292-3563
Office Hours :  MWF 9:30-10:00 or by appointment
 

 Homeworks

Grading

 Homework 30%,  Midterm 30% and Final 40%

 No late assignment will be accepted

Grader:  Yan Tang,  email : tangya@cse.ohio-state.edu, Office: DL190, phone: 614-247-4066
Office hours : Monday, Wednesday 1:00-2:00pm