Introduction to Algorithms

Course Description :

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.

Other Resources :

Handouts | Citation |

Licensed under a Creative Commons License by MIT OCW

 

Other Computer Science Courses

• Digital Circuits and Systems By: IIT Madras
• Computer Organization By: IIT Madras
• Computer Architecture By: IIT Delhi
• The Structure and Interpretation of Computer Programs, Fall 2009 By: UC Berkeley
• Computer Language Engineering By: MIT OCW
• Introduction to Copyright Law By: MIT OCW
• Computer Science III: Programming Paradigms By: Stanford University
• Internet Technology By: IIT Kharagpur
• Artificial Intelligence II By: IIT Kharagpur
• Computer Science I: Programming Methodology By: Stanford University

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image