How To Succeed

These are copied from "HowToSucceed" for CS483, but I think it applies to CS583 as well.

How to Succeed in CS 483 from Prof. Henry Hamburger
Useful hint from Christos Papadimitriou & Umesh Vazirani

Back to top of content

Back to the very top

Updates

quize6,7 posted, practice problem sets posted for chapters 24-26

Time & Location

Wed. 7:20 pm - 10:00 pm
Robinson Hall B104
Office: ST2 421
Office hour: Monday 5-6 pm
TA: Yi Yuan

Links

Topics

Jan 21:	Introduction
Jan 28:	Algorithm Analysis
Feb 04:	Sorting & Order Statistics
Feb 11:	Dynamic Programming
Feb 18:	Greedy Algorithms
Feb 25:	Graph Algorithms
Mar 04:	MST & Midterm review
Mar 25:	SS-Shortest Paths
Apr 01:	AP-Shortest Paths
Apr 08:	Maximum Flow
Apr 15:	Linear Programming
Apr 22:	NP completeness
Apr 29:	presentations

Assignments and Quizzes

Newsfeeds

Views

Current view: display

Back to top of content

Back to top of navigation

Back to the very top