Spring 2012 - CS 401 Computer Algorithms I
Instructor:
Ajay Kshemkalyani
Email:
ajayk@cs.uic.edu
Class meeting times: T,R 12:30-1:45pm in BH 309
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 2:00-3:00pm and by appointment
Teaching Assistant: Sol Ma
Email: sma21@uic.edu
phone: 312-451-8721
Office hours: M, R 3pm-5pm in SEO 932
This course focuses on theoretical principles.
Topics
- Basics of Algorithm Analysis
- Graphs
- Greedy Algorithms
- Divide and Conquer
- Dynamic programming
- Network Flow
- Computational intractability
- NP completeness
- Approximation algorithms
- Randomized algorithms
CS 202; or C or better in Stat 381 and MCS 360
The following is only a tentative breakup of the evaluation scheme
and is subject to changes as the course progresses.
- 2 Midterms (40%)
- Final (40%)
- Homeworks and quizzes (20%)
TENTATIVE course progress chart:
Will be updated as we progress.
- Week 1: (1/09-) Chapter 1
- Week 2: (1/16-) Chapter 1, 2, 3
- Week 3: (1/23-) Chapter 3, 4
- Week 4: (1/30-) Chapter 4; Homework 1 assigned
- Week 5: (2/6-) Chapter 5
- Week 6: (2/13-) Chapter 5, 6; Homework 1 due on Feb 16
- Week 7: (2/20-) Chapter 6
- Week 8: (2/27-) Midterm 1 on March 1, (Syllabus: Chaps 1-5). Chapter 6
- Week 9: (3/5-) Chapter 7; Homework 2 assigned
- Week 10: (3/12-) Chapter 7
- SPRING BREAK
- Week 11: (3/26-) Chapter 8; Homework 2 due on March 27
- Week 12: (4/2-) Chapter 8; Midterm 2: April 5, (Syllabus: Chaps 4-7). Homework 3 assigned
- Week 13: (4/09-) Chapter 8
- Week 14: (4/16-) Chapter 9; Homework 3 due on April 19
- Week 15: (4/23-) Chapter 11
- Final exam: on Friday May 4, 8:00-10:00am in BH 309
Syllabus: Chapters 1-9, 11.1
Current standing spreadsheet