CS 455-558 – Algorithms- Fall 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-017

Office hours : Tuesdays 1:00 pm – 2:00 pm Root Hall A-127

Grading :

·       4 Assignments (each 5 %)

·       Midterm (25 %)

·       Final Exam (55 %)

Assignments:

Lecture Notes:

Lecture1 (Introduction) (slides)

Lecture2(Recursive Functions) (slides)

Lecture3(Analyzing Algorithms) (slides)

Lectures4-5(Graph Theory and Graph Traversal) (slides)

Lectures6-8(Minimum Spanning Trees) (slides)

Lectures9(Shortest path in digraphs) (slides)

Lectures10-11(Interval Scheduling) (slides)

Lectures12-14(Divide and Conquer) (slides)

Lectures15-16(Weighted Interval Scheduling) (slides)