CS 458 - Algorithms 2

[ Announcements ] [ Academic Honesty ] [ General Information ] [ Lecture Notes ] [ Assignments ]

General Information

The course web page is http://karma.cs.drexel.edu/wiki/CS458/CS458. The course is in University Crossings 153 every Tuesday and Thursday from 3:30-4:50pm.

Contact:

The instructor for the campus section of this course is Dr. Ali Shokoufandeh, ashokouf@cs.drexel.edu. Office hours are Thursday 5-6pm in UC 141 or by appointment.

The TA for the course is Peter Bogunovich, pjb38@drexel.edu. His office hours are Wednesdays 2-4pm in UC 147 or by appointment.

Objectives:

This course is intended as broad introduction to the design and analysis of algorithms for some of the most frequently encountered combinatorial problems.

Prerequisites:

You should already have some basic knowledge of algorithms, growth functions and asymptotic notation, recurrences, probabilistics analysis, sorting, median and order statistics, and elementary data structures at the level of Data Structures and Algorithms I course (CS 457)

Expected Work

Biweekly Homework assignments (should be done independently), one Midterm and final examination.

Grading:

1. Homework: 30%
2. Midterm: 30%
3. Final exam: 40%

Text Book:

T.H. Cormen, C.E. Leiserson, and R.L. Rivest, C. Stein, Introduction to Algorithms, second edition.

Recommended References:

1. Kozen Design and Analysis of Algorithms Springer Verlag, 1992
2. Tarjan, Data Structures and Network Algorithms, SIAM Series in Applied Mathematics 44, 1983
3. Papadimitriou and Steiglitz, Combinatorial Optimization : Algorithms and Complexity, Prentice Hall 1982