Notes from the recitation on linear programming are here pdf
Notes from the third recitation on divide-and-conquer algorithms are here: pdf
Notes from the second recitation on greedy algorithms are here: pdf
The early deadline for homework 2 will be Monday 2/11 at 11:59 pm and the on-time deadline will be Wednesday 2/13 at 11:59 pm. There will be no late deadline.
Proof exercises from the recitation are available here: pdf
If you do not have a CS login or realize you are not on the course mailing list, please send an email to email@example.com (you will be responsible for any announcement made through the course mailing list).
A single algorithmic improvement can have a greater impact on our ability to solve a problem than ten years of incremental improvements in CPU speed. We study techniques for designing and analyzing algorithms. Typical problem areas addressed include numerical computing, hashing, searching, dynamic programming, graph algorithms, network flow, and string parsing and matching.
CS16, CS18 or CS19 and one of CS22 or CS45
Lectures will be held every Tuesday and Thursday, from 10:30 to 11:50 am, in CIT Center (Thomas Watson CIT) 219.
Download CS157 LaTeX Assignment Template (you are not required to use this template).