Build Dynamic Websites, Algorithms Video
- HTTP
- PHP - I
- PHP - II
- XML - I
- XML - II
- SQL - I
- SQL - II
- Java Script
- JavaScript - II
- Ajax - I
- Ajax - II
- Security
- Scalability
- Introduction - Analysis of Algorithms, Insertion Sort, Mergesort
- Asymptotic Notation | Recurrences | Substitution, Master Method
- Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
- Quicksort, Randomized Algorithms
- Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
- Order Statistics, Median
- Hashing, Hash Functions
- Universal Hashing, Perfect Hashing
- Relation of BSTs to Quicksort | Analysis of Random BST
- Red-black Trees, Rotations, Insertions, Deletions
- Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
- Skip Lists
- Amortized Algorithms, Table Doubling, Potential Method
- Competitive Analysis: Self-organizing Lists
- Dynamic Programming, Longest Common Subsequence
- Greedy Algorithms, Minimum Spanning Trees
- Shortest Paths I: Properties, Dijkstra
- Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
- Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
- Advanced Topics
- Advanced Topics (cont.)
- Advanced Topics (cont.)
- Advanced Topics (cont.)
No comments:
Post a Comment