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

• Building Dynamic Websites By: Harvard University
• Computer System Engineering By: MIT OCW
• Machine Structures (Fall 2008) By: UC Berkeley
• Digital Computer Organization By: IIT Kharagpur
• Principles of Programming Languages By: IIT Madras
• Introduction to Computer Science and Programming By: MIT OCW
• Artificial Intelligence By: IIT Kharagpur
• Advanced Topics in Software Systems By: University of Washington
• C Programming and Data Structures By: IIT Kharagpur
• Introduction to Copyright Law By: MIT OCW

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image