Video Lectures of Analysis of Algorithms (Video Lectures) for Computer Science Engineering (CSE) Exam
Watch free video lectures for Analysis of Algorithms (Video Lectures) covering all chapters/topics as per the latest syllabus in 2026. These concept videos, recorded lectures, and audio notes are designed to help Computer Science Engineering (CSE) students understand every topic clearly — anytime, anywhere. Start learning on EduRev.
Introduction of Algorithms
| Algorithm Vs Program 13:14 min |  |
| Overview: Algorithm Characteristics 10:25 min | |
| Algorithm Writing Techniques 08:39 min | |
| Algorithm Analysis Technique 10:26 min | |
| Frequency Count Method - 1 14:06 min | |
| Frequency Count Method - 3 10:26 min | |
| Understanding Asymptotic Notation in Algorithm - 1 31:03 min | |
| Understanding Asymptotic Notation in Algorithm - 2 12:07 min | |
| Understanding Asymptotic Notation in Algorithm - 3 14:50 min | |
| Asymptotic Notation Algorithm Exercise 10:29 min | |
| Master Asymptotic Notations with Exercise 14:57 min | |
| Comparing Functions in Analysis of Algorithm 31:09 min | |
Recurrence Relation
| Recurrence Relation for Decreasing Function - 1 18:25 min | |
| Recurrence Relation for Decreasing Function - 2 16:59 min | |
| Recurrence Relation for Decreasing Function - 3 16:41 min | |
| Summarizing Decreasing Function Concepts 27:42 min | |
| Tree Method Explained: Analyzing Recurrence Relations in Algorithm 25:57 min | |
| Understanding Recurrence Relations for Dividing Function - 1 15:47 min | |
| Recurrence Relations & Dividing Functions 10:23 min | |
| Understanding Recurrence Relations for Dividing Function - 3 14:09 min | |
| Master The Master's Theorem: Exercises Solved and Simplified 12:50 min | |
| Recurrence Relations in Analysis of Algorithms - 1 15:42 min | |
Introduction to Divide and Conquer
| Binary Search Fundamentals 26:36 min | |
| Binary Search Simplified 21:58 min | |
| Binary Search Recursive Algorithm Tutorial 18:38 min | |
| Binary Search Explained 25:51 min | |
| Understanding Time Complexity of Merge Sort 17:02 min | |
| Quick Sort Algorithm Time Complexity Analysis 19:25 min | |
| Merge Sort vs Quick Sort 15:10 min | |
| Quick Sort Algorithm Questions - 1 20:12 min | |
| Quick Sort Algorithm Questions - 2 09:41 min | |
| Quick Sort Algorithm Questions - 3 13:46 min | |
Basic Sorting Techniques
| Bubble Sort: Basic Sorting Techniques 23:27 min | |
| Selection Sort Explained 25:40 min | |
| Insertion Sort Explained - 1 15:35 min | |
| Insertion Sort Explained - 2 13:39 min | |
Heap Sort
| Heap Sort Fundamentals 18:32 min | |
| Explained: Heap Sort Stage 21:38 min | |
| Heap Sort Analysis - 2 14:11 min | |
| Heap Sort Analysis - 3 22:06 min | |
Greedy Method
| The Knapsack Problem: A Greedy Method Solution - 1 17:58 min | |
| The Knapsack Problem: A Greedy Method Solution - 2 18:10 min | |
| Optimal Merge Patterns 13:08 min | |
| Job Sequencing with Deadlines 28:55 min | |
| Kruskal’s Algorithm: Minimum Cost Spanning Tree - 1 17:02 min | |
| Kruskal’s Algorithm: Minimum Cost Spanning Tree - 2 08:44 min | |
| Minimum Cost Spanning Tree - 1 21:30 min | |
| Minimum Cost Spanning Tree - 2 15:27 min | |
| Graph Questions - 1 17:01 min | |
| Graph Questions - 2 13:52 min | |
| Graph Questions - 3 12:39 min | |
| Prim's Algorithm in Algorithm Analysis 19:08 min | |
| Shortest Distance Algorithm Uncovered - 1 25:23 min | |
| Shortest Distance Algorithm Uncovered - 2 15:19 min | |
| Master Huffman Coding for Data Compression 20:09 min | |
Dynamic Programming
| All Pair Shortest Path Algorithm - 1 14:52 min | |
| All Pair Shortest Path Algorithm - 2 12:08 min | |
| Master the LCS Problem with Dynamic Programming 29:08 min | |
| In-depth Analysis of Bellman Ford Algorithm - 2 20:51 min | |
| Matrix Chain Multiplication - 2 29:46 min | |
| Matrix Chain Multiplication - 3 24:00 min | |
| Mastering Multistage Graphs - 1 10:03 min | |
| Mastering Multistage Graphs - 1 28:59 min | |
| Dynamic Method Analysis of the Knapsack Problem - 1 25:51 min | |
| Dynamic Method Analysis of the Knapsack Problem - 2 20:28 min | |
| Travelling Salesman Problem Simplified 19:04 min | |
| Dynamic Method for Travelling Salesman Problem 37:06 min | |
BackTracking Algorithms
| N-Queen Problem Solved - 1 22:05 min | |
| N-Queen Problem Solved - 2 29:57 min | |
| N-Queen Problem Solved - 3 34:13 min | |
| Graph Color Problem Explained - 1 15:55 min | |
| Graph Color Problem Explained - 2 11:08 min | |
| Graph Color Problem Explained - 3 13:28 min | |
| Hamiltonian Cycle Problem - 1 12:03 min | |
| Hamiltonian Cycle Problem - 2 21:20 min | |
P and NP Class Problems
| Problem Reduction in Algorithm Analysis 26:59 min | |
| NP-Hard and NP-Complete in Algorithm Analysis 18:35 min | |
| Understanding NP-Completeness through Clique Problem - 1 06:51 min | |
| Understanding NP-Completeness through Clique Problem - 2 27:36 min | |
| NP Completeness in Algorithms: GATE Questions Breakdown - 1 13:52 min | |
| NP Completeness in Algorithms: GATE Questions Breakdown - 2 05:20 min | |
Hash Search
| Hash Search Explained 25:06 min | |
| Explained: Hash Search Collision Handling 13:18 min | |
| Hashing Techniques in Algorithm Analysis Masterclass 19:25 min | |
| Exercises: Hash Search 08:22 min | |
| Hash Search Questions - 1 20:54 min | |
| Hash Search Questions - 2 06:33 min | |
| Hash Search in Algorithms 11:32 min | |
