MIT / Engineering / Electrical
Lecture : Administrivia Introduction Analysis of Algorithms Insertion Sort Mergesort
By Erik Demaine | Introduction to Algorithms
Lecture 1 of 23
Rate this lecture -
Add to My Courses
   
More Lectures -
 
Course 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.
Courses Index
1 : Advanced Topics in Circuit Design   (Elad Alon / Berkeley)
2 : Introduction to Digital Integrated Circuits   (Jan RABAEY / Berkeley)
3 : Advanced Analog Integrated Circuits   (Elad Alon / Berkeley)
4 : Introduction to Microelectronic Circuits   (Bernhard BOSER / Berkeley)
5 : The Fourier Transform and its Applications   (Brad Osgood / Stanford)
6 : Introduction to Linear Dynamical Systems   (Stephen Boyd / Stanford)
7 : Convex Optimization I   (Stephen Boyd / Stanford)
8 : Convex Optimization II   (Stephen Boyd / Stanford)
9 : Circuits and Electronics   (Anant Agarwal / MIT)
10 : Computer System Engineering   (Samuel Madden / MIT)
11 : Principles of Digital Communications I   (Lizhong Zheng / MIT)
12 : Principles of Digital Communication II   (David Forney / MIT)
13 : Understanding Lasers and Fiberoptics   (Shaoul Ezekiel / MIT)
14 : Electromagnetics and Applications   (Multiple Instructors / MIT)
15 : Information and Entropy   (Paul Penfield / MIT)
16 : Fundamentals of Laser   (Sabieh Anwar / LUMS)
17 : Synchrotron Radiation for Materials Science   (David Attwood / Berkeley)
18 : Linear Integrated Circuits   (Clark Nguyen / Berkeley)
19 : Digital Circuit Design   (Ken Boyd / University of New South Wales)
20 : Speech and Audio Processing   (Multiple Multiple / University of New South Wales)