Courses:

Course Info

• Course Number / Code:
• 6.046J (Fall 2005) 
• Course Title:
• Introduction to Algorithms (SMA 5503) 
• Course Level:
• Undergraduate 
• Offered by :
• Massachusetts Institute of Technology (MIT)
  Massachusetts, United States  
• Department:
• Electrical Engineering and Computer Science 
• Course Instructor(s):
• Prof. Erik Demaine
  Prof. Charles Leiserson 
• Course Introduction:
•  
• 
  
  6.046J / 18.410J Introduction to Algorithms (SMA 5503)
  
  
  
  

  Fall 2005

  
  
  

  
  
  

  Course Highlights

  
  
  

  This course features a complete set of lecture notes and videos. Homework assignments with solutions are also available in the assignments section. In addition, an extensive bibliography of assigned and recommended readings is provided in the readings section. The course textbook was co-written by Prof. Leiserson.

  Previous versions of this course are also available: Fall 2004, Fall 2001.

  
  
  

  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.

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

  
  
  

  Special Features

  
  
  

  • Complete video lectures
  • Complete audio lectures

  
  
  

  Technical Requirements

  
  
  

  Special software is required to use some of the files in this course: .c, .java.