MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

MIT 6.046J / 18.410J Introduction to Algorithms - Fall 2005

Description

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5503 (Analysis and Design of Algorithms).

Course Homepage 6.046J / 18.410J Introduction to Algorithms (SMA 5503) Fall 2005

Course features at MIT OpenCourseWare page:

Complete MIT OCW video collection at MIT OpenCourseWare - VideoLectures.NET

 

Link this page

Would you like to put a link to this event on your homepage?
Go ahead! Copy the HTML snippet !

Reviews and comments:

Comment1 amith, June 9, 2009 at 11:45 a.m.:

thannxx lot for dis amazing stuff I was in dark when I was attending to my lectures
thanx to this now i can understand my lectures easilyyy

thnx againnn

Comment2 ConfusedStudent, June 19, 2009 at 6:58 p.m.:

Thank you so much for posting these lectures. My lecturer is the most neurotic person alive and lectures *ARE NOT* his gift. He changes examples 3, 4 and 5 times in the middle of a problem and does not explain things too well. And erases before you have any chance to read, comprehend and much less copy it down for later study.

-Confused Student

Comment3 Er. Saurabh Bisht, June 19, 2009 at 11:24 p.m.:

nice lecture but i guess time is off the essence
slide are best examples for it
anyways cant these lectured be compressed for easy download
I have low speed broadband connection and after 10 to 15% of
download it pops off.
g8 going mit

Comment4 Aveek Dasmalakar, July 11, 2009 at 11:59 a.m.:

Excellent lectures on algorithms.Thank you MIT for making available for all.great job

Comment5 akila, July 15, 2009 at 9:17 p.m.:

I can understand all lectures wiith in very short time period, thanx very very much.

Comment6 Omid, July 22, 2009 at 10:30 p.m.:

Only thing i can say is: thanks a lot.

Plz continue this way.
God With you

Comment7 srinee1122@hotmail.com, August 19, 2009 at 9:16 p.m.:

hearty thanks and congradulation! do more! i was not able to get thru MIT bt, these lectures made me satisfied!! thanks!! go MIT GOooooooooooooooooooooooo!! great STUFF!!!

Comment8 Kok-Meng Lam, November 6, 2009 at 7:04 a.m.:

I'm looking for network flows (max-min cut problems), do you know if there is a video lecture on this topic?

Thank you.

Lam

Comment9 Jure, December 13, 2009 at 12:24 p.m.:

Thank you Mr. professor! I live in Slovenia and because of this lectures I have at least a small taste of your University and a chance to learn from the best.
I would really like for you to introduce distance learning through conferences etc. with a real chance of getting a degree. Payed of course. This way we (people from outside the US and not in their 20's) would have a chance for a real leanings. Well, I know this is just wishful thinking, but maybe sometime in the future...

In any case I like your lectures and am very thankful for you making it available to all of us.
Thank you!
Jure S.

Write your own review or comment:

make sure you have javascript enabled or clear this field: