arrow_back
Why Algorithms are So Important | Algorithm Analysis
Time Complexity
Time complexity analysis - How to calculate running time?
Approximating Time Complexity | Idea Behind Asymptotic Analysis
What is Asymptotic Analysis | Need of Asymptotic Analysis
Asymptotically Unequal Functions | Asymptotic Analysis
Comparing Functions | Asymptotic Analysis
Basic maths needed for time complexity calculations
LIVE 1: Basic of Mathematics
Asymptotic comparison
EXTRA | LIVE 2: Asymptotic comparison of functions
Asymptotic comparison tricks
EXTRA | LIVE 3: Homework Solution Asymptotic Comparison
Big O Notation | Asymptotic Analysis
Examples on Big O Notation | Asymptotic Analysis
Big Omega Notation | Asymptotic Notations
Theta Notation | Asymptotic Notations
Little oh and Little Omega | Asymptotic Notations
Transitivity Property | Asymptotic Notations
Reflexivity Property | Asymptotic Notations
Symmetry Property | Asymptotic Notations
Transpose Symmetry Property | Asymptotic Notations
Trichotomy Property | Asymptotic Notations
EXTRA | Live Lecture 4 : Asymptotic Notation MCQ's
Cormen Complexity Part 1
EXTRA | CORMEN BOOK READING PART 1
EXTRA | CORMEN BOOK READING PART 2
EXTRA | LIVE LECTURE: Problem Solving
Live Test 1
TEST 1 SOLUTION DISCUSSION
ASSIGNMENT TEST 2
ASSIGNMENT DISCUSSION
Time Complexity: SET 1 (ITERATIVE PROGRAM)
Time Complexity: SET 2(ITERATIVE PROGRAM)
Time Complexity: SET 3(ITERATIVE PROGRAM)
Time Complexity: SET 4(ITERATIVE PROGRAM)
Time Complexity: SET 5(ITERATIVE PROGRAM)
Live Lecture : Iterative Program Complexity Examples
Recurrences
Introduction To Time Complexity of Recursive Program
Substitution Method Examples
Introduction To Tree Method
Examples on Tree Method
Master Theorem For Decreasing Functions
Original Master Theorem For Dividing Function
Extended Master Theorem For Dividing Function
Master-Theorem PDF
Greedy Method
Types of Solution: Solution Space | Feasible Solution | Optimal Solution
Introduction To Greedy Method
Fractional Knapsack Problem
Live Lecture: Fractional Knapsack
Time Complexity of Fractional Knapsack
Job Sequencing with Deadline
Huffman Coding
Live Lecture: Huffman Coding & Job Sequencing
Optimal Merge Pattern
Live Lecture : Properties of Spanning Tree
Application of Spanning Tree
Counting Possible Spanning Tree
Kruskal's Algorithm
Prim's Algorithm
Live Lecture 1: MCQ's on Minimum Spanning Tree
Live Lecture 2: MCQ's on Minimum Spanning Tree
Test on Greedy Method
Live Lecture 3: MCQ's on Minimum Spanning Tree
Live Lecture 4: MCQ's on Minimum Spanning Tree
Fractional knapsack. Huffman coding & Optimal merge pattern
Minimum Spanning Tree
Divide and Conquer
Introduction To Divide & Conquer
Dynamic Programming
Introduction to Dynamic Programming
Single Source Shortest Path: Dijkstra's Algorithm (Greedy Approach)
Bellman Ford Algorithm
Floyd Warshall All Pair Shortest Path Algorithm
Numerical on Dynamic Programming
0/1 Knapsack Problem using Top Down and Bottom up approach
Longest Common Subsequence Problem
Sum of Subset
Backtracking
Introduction To Backtracking
Sum of Subset Using Backtracking
Graph Coloring Using Backtracking
N Queens Problem Using Backtracking
Branch and bound
String Matching Algorithms
Naïve(Brute Force) String Matching Algorithm
KMP Algorithm
Rabin Karp Algorithm
Writing Strategy for Algorithm Paper | Mumbai University Exam