Spring 2013 - CS 401 Computer Algorithms I (Call no. 17455/20667)

Instructor: Ajay Kshemkalyani
Email: ajayk@cs.uic.edu
Class meeting times: T,R 12:30-1:45pm in BH 317
We may need to set up a few extra class meetings to make up for any of the regular meetings we miss due to my travel.
Office Hours in 915 SEO: T,R 3:30-4:30pm and by appointment

Teaching Assistant: Lakshmi Kaligounder
Email: lkalig2@uic.edu
Office hours: M: 12:30am-2:00pm, R: 10:30am-12noon in SEO 932

Resources


Course Description

Topics

  1. Some representative problems
  2. Basics of Algorithm Analysis
  3. Graphs
  4. Greedy Algorithms
  5. Divide and Conquer
  6. Dynamic programming
  7. Network Flow
  8. Computational intractability
  9. NP completeness
  10. Approximation algorithms
  11. Randomized algorithms

Prerequisites

CS 202; or C or better in Stat 381 and MCS 360

Grading

This course focuses on theoretical principles. There will be no programming. We expect to have about 5 homeworks. The following is a tentative breakup of the evaluation scheme and is subject to changes as the course progresses. The final grade is on the curve, i.e., this is relative grading - how you perform with respect to the others in the class.

Final grades


TENTATIVE course progress chart: Will be updated as we progress.


cs 401 Old Grades in the past and some other cs 401 Old Grades in the past.