CSE 6331: Algorithms (Spring 2018)

Class Notes:

Syllabus

Mathematical Foundation; estimation by integration

Examples-asymptotic notations; Answers

Examples-Analysis; Answers

Divide and Conquer

Dynamic Programming

Greedy Methods

Figures for MST proofs

Elementary Graph Algorithms

Figures

Max flow

Number-Theoretic Algorithms

Homework:

Homework 1 (Due Thursday 1/18)

Homework 2 (Due Tuesday 1/23)

Homework 3 (Due Thursday 1/25)

Homework 4 (Due Thursday 2/1)

Homework 5 (Due Tuesday 2/15)

Homework 6 (Due Tuesday 2/27)

Homework 7 (Due )

Homework 8 (Due )

Homework 9 (Due )

Grader:

Soumik Mandal, mandal.32@osu.edu, DL 586, Th 2:00-3:00 pm