Instructor   /   TA

• Instructor:   Dr. Yusu Wang	TA:     Xiaotong Liu
  Office Hour:         MW 1:00- 2:00pm      Room:                   DL 487     Phone:                   292-1309     Email:                   yusu at cse ...       URL  :                   www.cse.ohio-state.edu/~yusu/	Office Hours:           Thu 4:00 - 5:00pm, Fri 3:30 - 4:30pm.      Room:                         DL680    Email:                       liu.1952  at buckeyemail.osu.edu.

  
  

   

Course Description

     
    This course introduces students to the design and analysis of computer algorithms. Various paradigms for algorithm design will be covered, such as divide-and-conquer, dynamic programming and greedy strategy. Several data structures will be introduced to help to design efficient algorithms. Different algorithm analysis techniques will be described. We will also apply these design and analysis techniques to develop efficient graph, numeric and geometric algorithms.

    This is a graduate level course. Undergrads interested in this class and with sufficient background please come and talk to me.

 
   

Textbook   /   Grading

•   Primary textbook: 

 Introduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. Rivest and C. Stein.  MIT press / McGraw-Hill book company, 2001    

•   Reference book :

Algorithm Design by J. Kleinberg and E. Tardos. Addison-Wesley, 2005.

Algorithms by S. DasGupta, C. H. Papadimitriou and U. Vazirani, 2006.

•   Grading policy :

Assignments:   30%,    Midterm:   30%,    Final:   40%

   

Course Materials

• Schedule:
• Midterm: April 25, 11:30am - 12:50 pm (in class), Location DL357. Final: June 7, 11:30am - 1:18 pm, DL 0305. (University Registra scheduled time.)

• Lecture notes:
• Lec. 1 (ppt) : Introduction / course overview. Asymptotic complexity. (CLRS: Ch 1-4)
• Lec. 2--3 (ppt): Solving recurrences.
• Lec 4 (ppt): Randomized quick sort, order statistics.
• Lec 5 (ppt): Review of Heaps, and binary search tree.
• Lec 6 (ppt): 1D and 2D Range queries. See also Prof. David Mount's book (here and here) for the material covered.
• Lec 7--8 (ppt): Dynamic programming.
• Lec 9 (ppt): Greedy algorithms. Here is a more formal version of the greedy algorithm for the fractional Knapsack problem (pdf).
• Lec 10--11 (ppt1,ppt2): Amortized analysis and Union-find data structure.
• Lec 12--13 (ppt): Basic graph traversal algorithms: BFS, DFS, Topological sort.
• Lec 14 (ppt): Minimum spanning tree.
• Lec 15 (ppt): Single source shortest path.
• Lec 16--17 (ppt): All pairs shortest paths.

• Handouts / Homework:
• NOTE: There is a strict No-Late-Homework policy: all homework should be submitted before or in class on the due date. I will not accept any late homework unless you have obtained my permission beforehand.
• Pessimal Algorithm (pdf): interesting article opposite to what we learn
  
• Homework 1 is (here): it is due April 9th, 2012 (Mon) in class.
  
• Homework 2 is (here): it is due April 18th, 2012 (Wed) in class.
  
• Homework 3 is (here): it is due April 30th, 2012 (Mon) in class. (NOTE: This is changed from the previous April 27th deadline.)
  
• Homework 4 is (here): it is due May 14, 2012 (Mon) in class.
  
• Homework 5 is (here): it is due May 21, 2012 (Mon) in class.
  
• Homework 6 is (here): it is due May 30, 2012 (Wed) in class.
  

   

Announcements:

• Topics covered in midterm: Asymptotic time complexity, solving recurrences, divide-and-conque framework, sorting and order statisics, Range queries, and dynamic programming.
• Midterm is on April. 25th 11:30am -- 12:50am in class. Location: DL357 (the usual class room). The midterm is close-book close-notes.
• The deadline for hw1 is moved from April 4th to April 9th.