Click on the link to watch the video
- Introduction to Computer Algorithms
- Computer Algorithms – Abstract Data Types (ADT)
- Basics for Analyzing Computer Algorithms
- Mathematical Model of Computation
- Basics of Asymptotic Notations
- Analyzing Running Time of Iterative Program Code
- Analyzing Running Time of Recursive Code using Back Substitution method
- Analyzing Running Time of Recursive Code using Recursive tree Method
- Masters Theorem
- Understanding Space Complexity
- Insertion Sort Analysis
- Divide And Conquer Strategy of problem Solving
- Quick Sort Analysis
- Quick Sort Analysis for various partitioning scenarios
- Merge Sort Algorithm
- Merge Procedure illustrative Example
- Merge Sort Complexity Analysis
- Heap – Introduction
- Illustrative Example of MaxHeapify, Build-Max-Heap & ExtractMax Procedures
- Build MAx Hepiify Extract MAx Analysis
- HeapSort Strategy and Complexity Analysis
- Understanding HeapSort with an Illustrative Example
- Bucket Sort Strategy and Analysis
- Radix Sort and its Complexity Analysis
- Red Black Tree and Insertion
- Understanding RB Tree Deletion cases with an Example
- RB Tree Deletion Example-2
- RB Tree Deletion Example-3
- Splay Trees and Splaying
- Understanding Splay Operations with Examples
- How to Augment Data Structures -(explained using Order Statistics Tree)
- Finding Rank of node in a Tree ( using RB tree Augmented as Order Statistics Tree)
- Inserting Node In order Statistic Tree
- Interval trees An example of RB Tree Augmentation
- Graph Introduction
- Introduction To Greedy Algorithms
- Solving 0/1 and Fractional knapsack problem using Greedy Approach
- Understanding Minimum Spanning Tree (MST)
- Finding MST using Krushal Algorithm with an example
- Prims Method to find Minimum Spanning Tree (MST)
- Example of finding MST using Prim’s and Krushkal’s
- Analysis of Prim’s Methods
- Analysis of Krushkal Algorithm
- Shortest Path in Graph
- Djikstra Algorithm – Finding Single Source Shortest Path
- Bellman Ford Algorithm – Finding Single Source Shortest Path for Negative Weight Edges
- Introduction to Dynamic Programming
- Solving Knapsack Problem by dynamic programming
- Matrix Multiplication using dynamic programming
- Basics of String Matching & Naive String Matching Algorithm
- KMP String Matching Algorithm
- Boyer Moore String Matching
- P NP Problem Type introduction
- Problem Reducibility
- NP Hard & NP Complete Problems
Expertvision 