arrow_back
Test Series
Function Comparisons
Asymptotic Notations Test 1
Asymptotic Notations Test 2
Recurrence Relation
Greedy Methodology
Introduction
Why Algorithms are So Important
How to measure space and time complexity
Approximating time complexity
What is asymptotic analysis
Asymptotically Unequal Functions
Comparing Functions | Asymptotic Analysis
Basic maths needed for time complexity calculations
LIVE 1: Basic of Mathematics
Asymptotic comparison
LIVE 2: Asymptotic comparison of functions
Asymptotic comparison tricks
LIVE 3: Homework Solution Asymptotic Comparison
Big O Notation
Examples on Big O Notation
Big Omega Notation
Theta Notation
Little oh and Little Omega
Transitivity Property
Reflexivity Property
Symmetry Property
Transpose Symmetry Property
Trichotomy Property
Live Lecture 4 : Asymptotic Notation MCQ's
Cormen Complexity Part 1
CORMEN BOOK READING PART 1
CORMEN BOOK READING PART 2
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
Function Comparison
Asymptotic Notations
Time complexity of iterative program
Recurrences
Introduction To Time Complexity of Recursive Program
Substitution Method Examples
Live Lecture: Substitution Method Examples
Introduction To Tree Method
Examples on Tree Method
Live Lecture: Examples on Tree Method
Master Theorem For Decreasing Functions
Original Master Theorem For Dividing Function
Extended Master Theorem For Dividing Function
Live Lecture: Examples On Master Theorem
Master-Theorem PDF
Test 1 on Iterative & Recursive Time Complexity
Test 2 on Iterative & Recursive Time Complexity
Time Complexity of Recursive Program
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
Merge sort
Quick Sort
Dynamic Programming
Introduction to dynamic Programmming
Single Source Shortest Path: Dijkstra's Algorithm (Greedy Approach)
Bellman Ford Algorithm
Floyd Warshall All Pair Shortest Path Algorithm
Numerical on Dynamic Programming : Part 1
0/1 Knapsack Problem using Top Down and Bottom up approach
Longest Common Subsequence Problem
Sum of Subset
Travelling Salesman Problem Using Dynamic Approach
Backtracking
Introduction To Backtracking
Sum of Subset Using Backtracking
Graph Coloring Using Backtracking
N Queens Problem Using Backtracking
Branch and bound
What is Branch and Bound Technique ?
15 puzzle problem using Branch and Bound
Travelling Salesman Problem Using Branch and Bound
String Matching Algorithms
Naïve(Brute Force) String Matching Algorithm
KMP Algorithm
Rabin Karp Algorithm