|
07/19/2003
|
Partial homework 4 solutions added (ps, pdf). Updated 7/20 12:30am - 22.5-6 fixed. |
|
07/19/2003
|
Final exam will take place Monday 7/21 10:30am-12:30pm, room R-6111 (standard place and time), it will be cumulative. |
|
07/06/2003
|
Homework 3 solutions added (ps, pdf). |
|
07/05/2003
|
Midterm is scheduled for 7/9/03, it will cover first three weeks of lectures. |
|
07/05/2003
|
Homework 2 solutions added (ps, pdf), 7/6 - fix in 12.2-1. |
|
07/05/2003
|
Homework 1 solutions added (ps, pdf), 7/6 - fix in 4.1-1 added. |
|
06/15/2003
|
Project materials added. |
|
06/01/2003
|
Submission Rules |
|
Meets
|
Monday, Wednesday, Thursday 10:30-12:10 room R-6111 office hours: Monday, Wednesday 1pm-2pm at R-7101 |
|
Instructor
|
|
|
Textbook
|
Thomas H. Cormen et al. Introduction to Algorithms,
MIT Press, Cambridge, MA and McGraw-Hill, NY, 2001.
|
|
Course description
|
In this course we'll try to cover some basic general-purpose algorithms and techniques that every educated computer scientist or software developer should know. This includes estimation of algorithm complexity, sorting, search trees, graph algorithms, dynamic programming and greedy algorithms. |