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

• Artificial Intelligence: Introduction to Robotics By: Stanford University
• Discrete Structures By: IIT Madras
• Internet Technology By: IIT Kharagpur
• Computer Science I: Programming Methodology By: Stanford University
• Software Engineering By: IIT Bombay
• Computer Architecture By: IIT Delhi
• Data Structures And Algorithms By: IIT Delhi
• The Structure and Interpretation of Computer Programs, Fall 2009 By: UC Berkeley
• Digital Circuits and Systems By: IIT Madras
• The Structure and Interpretation of Computer Programs (Fall 2008) By: UC Berkeley

 

Comments

Post your Comments

Name :

Mail :

Website :

Comment :

 

Enter the charecters in image