Videos

MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

Posted by Metric Clay on October 16, 2009 at 10:48am

10

Get Embed Code

<object width="480" height="385"><param name="movie" value="http://www.youtube.com/p/8B24C31197EC371C&amp;hl=en&amp;fs=1"></param><param name="allowFullScreen" value="true"></param><param name="allowscriptaccess" value="never"></param><embed src="http://www.youtube.com/p/8B24C31197EC371C&amp;hl=en&amp;fs=1" type="application/x-shockwave-flash" width="480" height="385" allowscriptaccess="never"></embed></object>

Algorithms, (SMA, 5503), to, Introduction

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).

You need to be a member of Peacepink3 to add comments!

Join Peacepink3

★

Votes: 0

E-mail me when people leave their comments –

Follow

#xg { position:relative;top:120px; } #xn_bar { top:120px; }

Hello, you need to enable JavaScript to use Peacepink3.

Please check your browser settings or contact your system administrator.

Comments