CSE 6331: Algorithms (Autumn 2017)

 

Class Notes:

Syllabus (12:45-2:05); Syllabus (3:55-5:15)

Mathematical Foundation; estimation by integration

Examples-asymptotic notations; Answers

Examples-Analysis; Answers

Divide and Conquer

Dynamic Programming

Greedy Methods

Elementary Graph Algorithms

Figures

Max flow

Number-Theoretic Algorithms

 

Homework:

Homework 1 (Due Thursday 8/31)

Homework 2 (Due Tuesday 9/5)

Homework 3 (Due Thursday 9/7)

Homework 4 (Due Tuesday 9/19)

Homework 5 (Due:)

Homework 6 (Due:)

Homework 7 (Due:)

Homework 8 (Due:)

Homework 9 (Due )

Homework 10 ()

 

Graders:

(12:45-2:05) section: Lingyan Yin, yin.387@osu.edu, 118 Bolz Hall, TuTh 2:30-3:30pm

(3:55-5:15) section: Dayu Shi, dayu.g.shi@gmail.com, 118 Bolz Hall, Th 2:00-3:50pm