Design and Analysis of Algorithms

Course Description :

Overview, Framework for Algorithms Analysis, Asymptotic Notation, Algorithm Design Techniques, Divide And Conquer, Greedy Algorithms, Pattern Matching, Combinational Search and Optimization, Dynamic Programming, Approximation Algorithms.

Other Resources :

Citation |

 

Other Computer Science Courses

• Digital Circuits and Systems By: IIT Madras
• Machine Structures (Fall 2008) By: UC Berkeley
• Data Structures (Fall 2008) By: UC Berkeley
• Introduction to Copyright Law By: MIT OCW
• Computer Engineering By: McGill University
• Artificial Intelligence: Introduction to Robotics By: Stanford University
• Software Engineering By: IIT Bombay
• Computer Science II: Programming Abstractions By: Stanford University
• Data Structures, Fall 2009 By: UC Berkeley
• CSE 8B - Introduction to Computer Science: Java By: UC San Diego

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image