MIT OCW
Category: Computer Science
Visit Main Site
Description
Analysis of Algorithms; All Sorting techniques; Recurrences; Divide and Conquer: Strassen, Fibonacci, Polynomial Multiplication; Heaps and Hashing; Dynamic Programming; Graph Algorithms; number theoretic algorithms; amortized analysis;Shortest paths; Catching and parallel computing etc....
Views: 2221
Category: Computer Science
Visit Main Site
Description
Analysis of Algorithms; All Sorting techniques; Recurrences; Divide and Conquer: Strassen, Fibonacci, Polynomial Multiplication; Heaps and Hashing; Dynamic Programming; Graph Algorithms; number theoretic algorithms; amortized analysis;Shortest paths; Catching and parallel computing etc....
Views: 2221
Other Computer Science Courses
Principles of Programming Languages
Graduate Computer Architecture
Freshman Computer Science Seminar
Intermediate Software Design
Introduction to Copyright Law
Computer Language Engineering
Introduction to Computers
Computer Systems Engineering
Data Structures
Data Structures, Algorithms, and Applications in Java
Machine Structures
Operating Systems and Systems Programming
Graduate Computer Architecture
Freshman Computer Science Seminar
Intermediate Software Design
Introduction to Copyright Law
Computer Language Engineering
Introduction to Computers
Computer Systems Engineering
Data Structures
Data Structures, Algorithms, and Applications in Java
Machine Structures
Operating Systems and Systems Programming

Current Comments
1 comments so far (post your own)OnlineVideoLectures.com
Find more video lectures on :
Posted by OnlineVideoLectures.com on Saturday, 07.4.09 @ 05:43am | #100