January 02, 2013

Analysis of algorithms Video Tutorials

| |


Algorithms Analysis And Design, Fibonacci Sequences, Mathematical Models, Analysis Techniques, Solution To Recurrence With Distinct Roots, Algorithms Analysis Techniques, Time Complexity Of Algorithms,Relations Over Asymptotic Notations, Design Of Algorithms Using Brute Force Approach, Designing Algorithms Using Divide & Conquer Approach, Dynamic Programming For Solving Optimization Problems, Assembly-Line Scheduling Problem, Knapsack Problem Using Dynamic Programming, Optimal Weight Triangulation, Optimal Binary Search Trees, Constructing Dynamic Programming, Greedy Algorithms, Huffman Coding, Constructing A Huffman Codes, Breadth First Search, Applications Of Depth First Search, Backtracking And Branch & Bound Algorithms, Minimal Spanning Tree Problem, Single-Source Shortest Path, Evaluation And Addition Using Coefficient Form, Dijkstra’s Algorithm, All Pairs Shortest Paths, The Floyd-Warshall Algorithm And Johnson’s Algorithm, Number Theoretic Algorithms, RSA Cryptosystem, Advanced Algorithms Analysis And Design, Polynomials And Fast Fourier Transform, NP Completeness.



Note: Use Proxy Servers to access Video Tutorials..

No comments:

Post a Comment