Skip to site navigation

Skip to content

CS483 Spring 2009: Analysis of Algorithms Instructor: Jyh-Ming Lien

Printable View
Backlinks

How To Succeed

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

Page last modified on February 29, 2008, at 01:48 PM

Search
Printable View
Backlinks
Recent Changes
AllRecentChanges
Feeds

Back to top of content

Back to the very top

Updates

lecture 10 and programming assignment added

Time & Location

Thur. 4:30 - 7:10 pm
Innovation Hall 204
Office: ST2 421
Office hour: Monday 6pm-7pm
TA: Zhi Zhang

Links

CS483 Home
Discussion Board
How to Succeed
CS culture form

Lecture Notes

Jan 22	Introduction
Jan 29	Algorithms with numbers
Feb 05	Divide-n-conquer algorithms
Feb 12	Graphs
Feb 19	Paths in graphs
Feb 26	Greedy algorithms
Mar 26	Dynamic programming
Apr 09	Linear programming
Apr 23	NP-completeness

Assignments and Quizzes

quiz 01
quiz 02
quiz 03
quiz 04
Programming Assignment

Newsfeeds

Feed for group Main
Feed for All Recent Changes
About Feeds ?

Views

Current view:

Reset to default
Display
Standard
Author
Admin

Back to top of content

Back to top of navigation

Back to the very top