CS 658 – Algorithms- Spring 2016

Course Texts :

Algorithm Design, J. Kleinberg, É. Tardos, Addison Wesley, 2006

Introduction to Algorithms (3rd Edition), T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2009

Instructor : Arash Rafiey (arash.rafiey@indstate.edu) Office : Root Hall A-127

Date and Place :

Lectures : Tuesdays and Thursdays 3:30 pm – 4:45 pm Root Hall A-008

Office hours : Thursdays 2:00 pm – 3:00 pm Root Hall A-127

Grading :

·       2 Assignments and 2 Presentations (each 10 %)

·       Midterm (25 %)

·       Final Exam (35 %)

Assignments :

Assignment1

Lecture Notes :

Lecture1(Introduction) (slides)

Lecture2 (Applications of BFS and DSF) (slides)

Lecture3(Graph Search Algorithms) (slides)

Lecture4(Dynamic Programming) (slides)

Lecture5(Dynamic Programming(Matrix Multiplications)) (slides)

Lecture6(NP problems) (slides)