Data Structures and Algorithms for GATE — Complete Playlist
4.0
(0)
7 learners
What you'll learn
This course includes
- 182.5 hours of video
- Certificate of completion
- Access on mobile and TV
Course content
1 modules • 298 lessons • 182.5 hours of video
Data Structures and Algorithms for GATE — Complete Playlist
298 lessons
• 182.5 hours
Data Structures and Algorithms for GATE — Complete Playlist
298 lessons
• 182.5 hours
- Syllabus of Data Structures and Algorithms | DSA for GATE | GATE 2023 26:44
- Introduction to data structures and algorithms | DSA | Part 1 | GATE 2023 34:07
- Introduction to data structures and algorithms | DSA | Part 2 | GATE 2023 45:39
- How to analyze algorithm | Aposteriori analysis | analysis of algorithm 40:53
- How to analyze algorithm | Apriori analysis | analysis of algorithm 36:47
- How to analyze algorithm | Asymptotic Notations (part 1) | analysis of algorithm 36:19
- How to analyze algorithm | Asymptotic Notations (part 2) | Big O notation | analysis of algorithm 27:02
- How to analyze algorithm | Asymptotic Notations (part 3) | Big O notation | analysis of algorithm 29:42
- How to analyze algorithm | Asymptotic Notations (part 4) | Big O notation | analysis of algorithm 31:50
- How to analyze algorithm | Asymptotic Notations (part 5) | Big omega notation |analysis of algorithm 38:53
- How to analyze algorithm | Asymptotic Notations (part 6) | Theta notation | analysis of algorithm 47:44
- How to analyze algorithm | Asymptotic Notations (part 7) | small o and small omega (ω) notation 29:15
- How to analyze algorithm | Properties of Asymptotic Notations (part 1) 36:47
- How to analyze algorithm | Properties of Asymptotic Notations (part 2) 31:36
- How to analyze algorithm | Properties of Asymptotic Notations (part 3) 43:20
- How to Analyze Algorithm | Practice Questions on Asymptotic Notations | Analysis of Algorithm 29:28
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #2 26:54
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #3 37:14
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #4 30:54
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #5 31:11
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #6 27:13
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #7 46:45
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #8 34:33
- How to Analyze Algorithm | Analysis of Algorithm Practice Questions on Asymptotic Notations #9 23:08
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 1 27:50
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 2 38:34
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 3 37:44
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 4 26:54
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 5 30:05
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 6 25:39
- Finding Time Complexity | Analysis and Calculation | Time Complexity of iterative Algo | part 7 38:59
- Finding Space Complexity | Analysis and Calculation | Iterative Algorithms 25:27
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 1 29:25
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 2 34:29
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 3 34:38
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 4 31:00
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 5 25:14
- Finding Space and Time Complexity of Recursive Algorithms | Analysis and Calculation | Part 6 25:34
- Finding Space and Time Complexity of Recursive Algorithms | fibonacci series exact complexity |#7 41:48
- Tower of Hanoi solved using Recursion | Part 1 28:57
- Tower of Hanoi solved using Recursion | Part 2 28:55
- SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 1 29:14
- SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 2 36:12
- SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 3 43:54
- SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 4 28:50
- SUBSTITUTION METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 5 25:36
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 1 43:53
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 2 32:20
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 3 33:37
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 4 33:38
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 5 38:40
- TREE METHOD FOR SOLVING ANY RECURRENCE IN HINDI | part 6 39:05
- Master Theorem with Proof part 2 32:34
- Master Theorem with Proof part 1 28:28
- Master Theorem with Proof part 3 35:51
- Master Theorem with Proof part 4 15:57
- Master Theorem with Proof part 5 51:07
- Practice Questions on Master Theorem Part 1 28:31
- Practice Questions on Master Theorem Part 2 38:15
- Practice Questions on Master Theorem Part 3 31:25
- Practice Questions on Master Theorem Part 4 45:12
- Advanced Master Theorem | Extended Master Theorem with intuitive proof 37:55
- Linear Search part 1 42:31
- Linear Search part 2 35:45
- Linear Search part 3 23:16
- Binary Search part 1 34:20
- Binary Search part 2 39:25
- Binary Search part 3 (Modified Binary Search) 37:35
- Binary Search part 4 (Average case exact number of comparisons) 34:12
- Binary Search part 5 (Average case analysis of Binary search) 26:23
- Binary Search part 6 (Practice Questions) 42:31
- Binary Search part 7 (Practice Questions) #PROGRAMMING #PLACEMENTS 29:14
- Binary Search part 8 (Practice Questions) #PROGRAMMING #PLACEMENTS 46:49
- Binary Search part 9 (Practice Questions) #PROGRAMMING #PLACEMENTS 32:04
- Binary Search part 10 (Practice Questions) #PROGRAMMING #PLACEMENTS 22:57
- Selection Sort | Time Complexity(Best, Avg & Worst) Analysis #PROGRAMMING #PLACEMENTS 38:55
- Selection Sort | Stable or Not | In Place or Not | Practice Questions #PROGRAMMING #PLACEMENTS 30:15
- Bubble Sort Part 1 | Performance of Bubble Sort | Algorithm #PROGRAMMING #PLACEMENTS 32:24
- Bubble Sort Part 2 | Performance of Bubble Sort | Algorithm #PROGRAMMING #PLACEMENTS 41:42
- Insertion Sort | Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 36:10
- Insertion Sort (part 2)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 38:01
- Insertion Sort (part 3)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 20:10
- Counting Sort (part 1)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 38:26
- Counting Sort (part 2)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 17:56
- Radix Sort (part 1)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 39:06
- Radix Sort (part 2)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 36:40
- Heap Sort (part 1)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 35:15
- Heap Sort (part 2)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 32:15
- Heap Sort (part 3)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 41:08
- Heap Sort (part 4)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 47:29
- Heap Sort (part 5)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 58:10
- Heap Sort (part 6)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 35:33
- Heap Sort (part 7)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 32:01
- Heap Sort (part 8)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 49:58
- Heap Sort (part 9)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 41:58
- Heap Sort (part 10)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 39:09
- Heap Sort (part 11)| Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 30:05
- Heap Sort (part 12) Time Complexity Analysis | Algorithm #PROGRAMMING #PLACEMENTS 27:48
- ARRAY IN DATA STRUCTURES PART 1 45:30
- ARRAY IN DATA STRUCTURES PART 2 37:28
- ARRAY IN DATA STRUCTURES PART 3 38:09
- ARRAY IN DATA STRUCTURES PART 4 44:53
- Introduction to Linked List Part 1 46:26
- Introduction to Linked List Part 2 01:06:50
- Introduction to Linked List Part 3 42:14
- Introduction to Linked List Part 4 36:20
- Introduction to Linked List Part 5 54:00
- Introduction to Linked List Part 6 50:04
- Introduction to Linked List Part 7 46:08
- Introduction to Linked List Part 8 53:38
- Introduction to Linked List Part 9 44:26
- Introduction to Linked List Part 10 41:42
- Introduction to Linked List Part 11 41:10
- Introduction to Linked List Part 12 38:06
- Introduction to Linked List Part 13 30:59
- Introduction to Linked List Part 14 36:02
- Tree in Data Structure (Part 1)| Introduction to Trees | Data Structures Tutorials 25:58
- Tree in Data Structure (Part 2)| Introduction to Trees | Data Structures Tutorials 53:25
- Tree in Data Structure (Part 3)| Introduction to Trees | Data Structures Tutorials 44:58
- Tree in Data Structure (Part 4)| Introduction to Trees | Data Structures Tutorials 52:11
- Tree in Data Structure (Part 5)| Introduction to Trees | Data Structures Tutorials 29:34
- Tree in Data Structure (Part 6)| Introduction to Trees | Data Structures Tutorials 42:15
- Binary Search Tree in Data Structure (Part 1)| Introduction to Trees | Data Structures Tutorials 47:44
- Binary Search Tree in Data Structure (Part 2)| Introduction to Trees | Data Structures Tutorials 35:31
- Binary Search Tree in Data Structure (Part 3)| Introduction to Trees | Data Structures Tutorials 47:39
- Binary Search Tree in Data Structure (Part 4)| Introduction to Trees | Data Structures Tutorials 40:07
- Binary Search Tree in Data Structure (Part 5)| Introduction to Trees | Data Structures Tutorials 01:07:04
- Tree Traversal in Data Structure (Part 1)| Introduction to Trees | Data Structures Tutorials 48:11
- Tree Traversal in Data Structure (Part 2)| Introduction to Trees | Data Structures Tutorials 01:01:10
- Tree Traversal in Data Structure (Part 3)| Introduction to Trees | Data Structures Tutorials 01:10:30
- Tree Traversal in Data Structure (Part 4)| Introduction to Trees | Data Structures Tutorials 34:02
- Tree Traversal in Data Structure (Part 5)| Introduction to Trees | Data Structures Tutorials 01:01:49
- GATE 2014 question on IN Order traversal | Introduction to Trees | Data Structures Tutorials 45:58
- GATE 2014 question on Leftmost child Right Sibling| Introduction to Trees| Data Structures Tutorials 20:01
- Counting Trees in Data Structure (Part 1)| Introduction to Trees | Data Structures Tutorials 38:04
- Counting Trees in Data Structure (Part 2)| Introduction to Trees | Data Structures Tutorials 25:11
- Most important PYQ of TREE | Tree in Data Structure|Introduction to Trees| Data Structures Tutorials 47:01
- AVL Trees in Data Structure (Part 1)| Introduction to Trees | Data Structures Tutorials 41:29
- AVL Trees in Data Structure (Part 2)| Introduction to Trees | Data Structures Tutorials 52:15
- AVL Trees in Data Structure (Part 3)| Introduction to Trees | Data Structures Tutorials 36:17
- AVL Trees in Data Structure (Part 4)| Introduction to Trees | Data Structures Tutorials 27:23
- AVL Trees in Data Structure (Part 5)| Introduction to Trees | Data Structures Tutorials 40:17
- AVL Trees in Data Structure (Part 6)| Introduction to Trees | Data Structures Tutorials 32:39
- GATE 2014 question on Sub Trees | Introduction to Trees | Data Structures Tutorials 25:13
- Expression Trees in Data Structure| Introduction to Trees | Data Structures Tutorials 20:42
- Various representation of Trees| Introduction to Trees | Data Structures Tutorials 24:34
- Graph Representation in Data Structure |Adjacency Matrix and Adjacency List(part 1) 36:06
- Graph Representation in Data Structure |Adjacency Matrix and Adjacency List(part 2) | Universal Sink 50:12
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 1 36:09
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 2 37:17
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 3 41:45
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 4 36:51
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 5 36:22
- BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA | Part 6 37:38
- BFS & DFS | Breadth First Search | Depth First Search (Iterative)| Graph Traversing | DAA | Part 7 27:18
- BFS & DFS | Breadth First Search | Depth First Search (Iterative)| Graph Traversing | DAA | Part 8 27:42
- BFS & DFS | Breadth First Search | Depth First Search (Iterative)| Graph Traversing | DAA | Part 9 29:39
- BFS & DFS | Breadth First Search | Depth First Search Discover time and Finish Time | DAA | Part 10 29:49
- BFS & DFS | Breadth First Search | Depth First Search Types of Edges | DAA | Part 11 28:54
- BFS & DFS | Breadth First Search | Depth First Search Types of Edges | DAA | Part 12 38:09
- BFS & DFS | Breadth First Search | Breadth First Search Types of Edges | DAA | Part 13 29:58
- Parameter Passing Techniques | Call by value | Call by Reference | Part 1 24:24
- Parameter Passing Techniques | Call by value | Call by Reference | Part 2 26:08
- Introduction To Stacks part 1 | GATE 2025 29:12
- Introduction To Stacks part 2 | GATE 2025 25:59
- Introduction To Stacks part 3 | GATE 2025 26:17
- Introduction To Stacks part 4 | GATE 2025 38:16
- Introduction To Stacks part 5 | PYQs on Stack | GATE 2025 38:29
- Introduction To Stacks part 6 | Implementing Stack Using LLst| GATE 2025 22:14
- Introduction to Queue Data structure | Part 1| Data Structure #queue | GATE 2025 33:28
- Introduction to Queue Data structure | Part 2| Data Structure #queue | GATE 2025 40:26
- Introduction to Queue Data structure | Part 3| Data Structure #queue | GATE 2025 36:01
- Introduction to Queue Data structure | Part 4| Data Structure #queue | GATE 2025 36:57
- Introduction to Queue Data structure | Part 5| Data Structure #queue | GATE 2025 32:41
- Introduction to Queue Data structure | Part 6| Data Structure #queue | GATE 2025 31:32
- Introduction to Queue Data structure | Part 7| Data Structure #queue | GATE 2025 36:13
- Introduction to Queue Data structure | Part 8 | Data Structure #queue | GATE 2006 question 23:22
- Introduction to Queue Data structure | Part 9 | Data Structure #queue | GATE 2022 question 27:26
- Introduction to Queue Data structure | Part 10 | Data Structure #queue | GATE 2025 35:24
- Introduction to Queue Data structure | Part 11 | Data Structure #queue | GATE 2025 33:40
- Introduction to Queue Data structure | Part 12 | Data Structure #queue | GATE 2025 27:38
- Introduction to Priority Queue Data structure | Part 13 | Data Structure #queue | GATE 2025 41:35
- Introduction to Priority Queue Data structure | Part 14 | Data Structure #queue | GATE 2025 22:19
- Application of Stacks part 1 | Fibonacci Series | GATE 2025 34:27
- Application of Stacks part 2 | Fibonacci Series | GATE 2025 26:37
- Application of Stacks part 3 | Tower of Hanoi | GATE 2025 36:06
- Application of Stacks part 4 | Intro to Prefix ,Infix and Postfix | GATE 2025 27:56
- Application of Stacks part 5 | Intro to Prefix ,Infix and Postfix | GATE 2025 31:12
- Application of Stacks part 6 | Infix to Postfix | GATE 2025 39:09
- Very beautiful question on MST | GATE 2025 25:54
- Application of Stacks part 7 | Postfix evaluation | GATE 2025 30:11
- Application of Stacks part 8 | Infix to prefix and Postfix to prefix using Stack | GATE 2025 26:23
- Application of Stacks part 9 | Infix to prefix and Postfix to prefix using Stack | GATE 2025 28:58
- Application of Stacks part 10 | Types of recursion | GATE 2025 23:28
- Application of Stacks part 11 | Types of recursion | GATE 2025 35:40
- Syllabus of Algorithms | GATE 2025 19:07
- Min Max Algorithm without Divide & Conquer 32:53
- Divide and Conquer | Algorithm | Part 1 39:28
- Divide and Conquer | Algorithm | Part 2 28:55
- Divide and Conquer | Algorithm | Part 3 27:39
- Min Max Algorithm with Divide & Conquer part 1 31:49
- Min Max Algorithm with Divide & Conquer part 2 32:42
- Min Max Algorithm with Divide & Conquer part 3 36:39
- Min Max Algorithm with Divide & Conquer part 4 01:05:18
- Power of element with Divide & Conquer 42:33
- Binary Search (Application of DAC) Part 1 #PROGRAMMING #PLACEMENTS 34:35
- Binary Search (Application of DAC) Part 2 #PROGRAMMING #PLACEMENTS 01:12:43
- Merge sort part 1 38:41
- Merge sort part 2 46:24
- Merge sort part 3 42:41
- Merge sort part 4 40:24
- Merge sort part 5 36:23
- Merge sort part 6( Fibonacci merge sort) 37:01
- Merge sort part 7( Finding A U B and A ∩ B) | Union and Intersection using merge algorithm 35:36
- Merge sort part 8( Finding A U B and A ∩ B) | Union and Intersection using merge algorithm TC 29:51
- Merge sort part 9( Straight 2 way merge sort , k way merging) 39:47
- Merge sort part 10(Counting the number of inversions in an array) 28:20
- Merge sort part 11(Counting the number of inversions in an array) 27:54
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 1 37:50
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 2 23:04
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 3 39:15
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 4 30:59
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 5 43:15
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 6 51:57
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 7 54:44
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 8 37:39
- How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer | Part 9 50:54
- How Randomize Quick Sort Works | Randomize Quick Sort with Example | Divide and Conquer | Part 10 39:51
- Selection Procedure | Easy Explanation | Divide & Conquer | Algorithm Gate CS | part 1 30:26
- Selection Procedure | Easy Explanation | Divide & Conquer | Algorithm Gate CS | part 2 25:34
- Strassens Matrix Multiplication part 1 40:50
- Strassens Matrix Multiplication part 2 45:48
- Introduction to Greedy Techniques With Example | What are Greedy Techniques 28:07
- Job Sequencing Algorithm with Example | Greedy Techniques 34:42
- Job Sequencing Algorithm with Example | Greedy Techniques | part 2 41:08
- Knapsack Problem With Example| Greedy Techniques| Algorithm | part3 16:48
- Knapsack Problem With Example| Greedy Techniques| Algorithm | part2 32:44
- Knapsack Problem With Example| Greedy Techniques| Algorithm 36:36
- Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm) | part 1 32:01
- Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm) | part 2 33:26
- Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm) | part 3 19:25
- Optimal Merge Pattern using Greedy Method in Hindi | Algorithm 32:48
- What is Spanning Tree with Examples in Hindi | Algorithm 29:00
- What is Spanning Tree with Examples in Hindi | Algorithm | part 2 47:53
- What is Spanning Tree with Examples in Hindi | Algorithm | part 3 (Kruskal's algo) 39:46
- What is Spanning Tree with Examples in Hindi | Algorithm | part 4 (Prim's algo) 36:05
- What is Spanning Tree with Examples in Hindi | Algorithm | part 5 42:20
- What is Spanning Tree with Examples in Hindi | Algorithm | part 6 40:55
- What is Spanning Tree with Examples in Hindi | Algorithm | part 7 29:26
- What is Spanning Tree with Examples in Hindi | Algorithm | part 8 30:53
- What is Spanning Tree with Examples in Hindi | Algorithm | part 9 27:26
- What is Spanning Tree with Examples in Hindi | Algorithm | part 10 34:48
- What is Spanning Tree with Examples in Hindi | Algorithm | part 11 36:08
- What is Spanning Tree with Examples in Hindi | Algorithm | part 12 34:24
- What is Spanning Tree with Examples in Hindi | Algorithm | part 13 40:18
- What is Spanning Tree with Examples in Hindi | Algorithm | part 14 40:31
- What is Spanning Tree with Examples in Hindi | Algorithm | part 15 36:50
- What is Spanning Tree with Examples in Hindi | Algorithm | part 16 34:15
- Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method part 1 35:57
- Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method part 2 40:36
- Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method part 3. 44:49
- Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method part 4 36:28
- Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Single Source Shortest Path | part 1 35:51
- Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Single Source Shortest Path | part 2 54:57
- Topological Sorting with examples | Topological Sorting using DFS and BFS 38:44
- Single Source Shortest Path in DAG(Directed Acyclic Graph) 25:34
- Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA) | Part 1 44:02
- Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA) | Part 2 46:20
- Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA) | Part 3 23:16
- Matrix Chain Multiplication using Dynamic Programming | GATECSE | DAA | part 1 47:50
- Matrix Chain Multiplication using Dynamic Programming | GATECSE | DAA | part 2 51:07
- Matrix Chain Multiplication using Dynamic Programming | GATECSE | DAA | part 3 49:43
- Matrix Chain Multiplication using Dynamic Programming | GATECSE | DAA | PYQs 41:44
- Longest Common Subsequence Using Dynamic Programming | GATECSE | DAA | part 1 52:16
- Longest Common Subsequence Using Dynamic Programming | GATECSE | DAA | part 2 01:02:29
- Longest Common Subsequence Using Dynamic Programming | GATECSE | DAA | part 3 43:58
- Longest Common Subsequence Using Dynamic Programming | GATECSE | DAA | part 4 55:24
- Multistage Graph | Dynamic Programming | part 1 39:17
- Multistage Graph | Dynamic Programming | part 2 43:50
- 0/1 Knapsack Problem using Dynamic Programming || GATECSE || DAA 53:12
- 0/1 Knapsack Problem using Dynamic Programming || GATECSE || DAA | part 2 38:17
- 0/1 Knapsack Problem using Dynamic Programming || GATECSE || DAA | part 3 01:07:52
- Sum of Subsets Problem | Dynamic Programming | part 1 44:16
- Sum of Subsets Problem | Dynamic Programming | part 2 36:30
- Traveling Salesman Problem | Dynamic Programming 47:06
- Floyd Warshall Working with example | All Pair Shortest Path Algorithm | part 1 36:52
- Floyd Warshall Working with example | All Pair Shortest Path Algorithm | part 2 24:16
- What is hashing with example | Hashing in data structure | part 1 28:28
- What is hashing with example | Hashing in data structure | part 2 32:59
- What is hashing with example | Hashing in data structure | part 3 35:37
- What is hashing with example | Hashing in data structure | part 4 41:32
- What is hashing with example | Hashing in data structure | part 5 33:01
- What is hashing with example | Hashing in data structure | part 6 47:33
- What is hashing with example | Hashing in data structure | part 7: 32:41
- What is hashing with example | Hashing in data structure | part 8 47:39
- What is hashing with example | Hashing in data structure | part 9 (GATE PYQs) 37:11
- What is hashing with example | Hashing in data structure | part 10 29:39
- What is hashing with example | Hashing in data structure | part 11 51:30
Take this course with you
Download the app to continue lessons from your phone anytime.
