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

• C++ Programming By: other
• CSE 8B - Introduction to Computer Science: Java By: UC San Diego
• C Programming and Data Structures By: IIT Kharagpur
• COMP1927 Data Structures and Algorithms By: The University of New South Wales
• Introduction to Computer Programming for Scientists and Engineers (Spring 2009) By: UC Berkeley
• Principles of Programming Languages By: IIT Madras
• Operating Systems and System Programming, Spring 2010 By: UC Berkeley
• Computer Networks By: IIT Kharagpur
• Computer Graphics By: IIT Madras
• Computer Science I: Programming Methodology By: Stanford University

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image