L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA
11:27
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA
3.2M viewsJan 7, 2020
YouTubeGate Smashers
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
1.7M viewsJan 8, 2020
YouTubeGate Smashers
L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm
8:34
L-3.6: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm
1.1M viewsJan 22, 2020
YouTubeGate Smashers
L-3.0: Divide and Conquer | Algorithm
4:03
L-3.0: Divide and Conquer | Algorithm
1.1M viewsMar 12, 2021
YouTubeGate Smashers
L-3.3: How Merge Sort Works?? Full explanation with example
9:52
L-3.3: How Merge Sort Works?? Full explanation with example
1.4M viewsJul 28, 2022
YouTubeGate Smashers
L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm
10:23
L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm
711.8K viewsSep 4, 2021
YouTubeGate Smashers
L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm
8:57
L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm
1M viewsSep 2, 2021
YouTubeGate Smashers
L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm
8:16
L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm
953.4K viewsJan 21, 2020
YouTubeGate Smashers
L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm
25:31
L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm
1.1M viewsMay 26, 2021
YouTubeGate Smashers
L-3.18: Heap sort with Example | Heapify Method
13:38
L-3.18: Heap sort with Example | Heapify Method
1.6M viewsMar 13, 2021
YouTubeGate Smashers
Lec -38: Introduction to T Flip Flop | Circuit, Working, Characteristics & Excitation Table
4:13
Lec -38: Introduction to T Flip Flop | Circuit, Working, Characteristics & Excitation Table
956.5K viewsJun 2, 2022
YouTubeGate Smashers
L-5.6: Multistage Graph | Dynamic Programming
17:32
L-5.6: Multistage Graph | Dynamic Programming
391.6K viewsApr 10, 2021
YouTubeGate Smashers
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)
9:08
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)
1.1M viewsFeb 4, 2020
YouTubeGate Smashers
L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting
15:32
L-3.7: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting
1.1M viewsAug 5, 2020
YouTubeGate Smashers
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams
12:52
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams
1.2M viewsDec 5, 2018
YouTubeGate Smashers
L-5.5: Sum of Subsets Problem | Dynamic Programming
15:06
L-5.5: Sum of Subsets Problem | Dynamic Programming
455.8K viewsApr 8, 2021
YouTubeGate Smashers
Lec-8: Naive Bayes Classification Full Explanation with examples | Supervised Learning
13:31
Lec-8: Naive Bayes Classification Full Explanation with examples | Supervised Learning
1.2M viewsSep 1, 2023
YouTubeGate Smashers
L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm)
6:24
L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm)
626.5K viewsMay 20, 2021
YouTubeGate Smashers
L-3.13: Introduction to Heap Tree with examples | Max Min Heap
7:45
L-3.13: Introduction to Heap Tree with examples | Max Min Heap
1.2M viewsMar 4, 2021
YouTubeGate Smashers
L-6.1: What is hashing with example | Hashing in data structure
5:53
L-6.1: What is hashing with example | Hashing in data structure
2.3M viewsJan 16, 2021
YouTubeGate Smashers
L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm
7:14
L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm
1.2M viewsOct 11, 2021
YouTubeGate Smashers
L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm
9:31
L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm
778.3K viewsOct 12, 2021
YouTubeGate Smashers
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example
10:34
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example
3.9M viewsMay 19, 2018
YouTubeGate Smashers
Lec - 1: Introduction to Data Warehouse🏺 with Examples
5:42
Lec - 1: Introduction to Data Warehouse🏺 with Examples
646.3K viewsJul 31, 2023
YouTubeGate Smashers
L-3.10: Counting Sort | Easiest explanation with example
7:37
L-3.10: Counting Sort | Easiest explanation with example
548.3K viewsApr 1, 2022
YouTubeGate Smashers
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm
5:38
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm
1.5M viewsJan 19, 2020
YouTubeGate Smashers
Min Max Algorithm with Divide & Conquer🏆
8:37
Min Max Algorithm with Divide & Conquer🏆
245.8K viewsJul 1, 2023
YouTubeGate Smashers
Lec-1: Digital Logic Syllabus for GATE, UGCNET etc.| Full Playlist for College/University Students
4:40
Lec-1: Digital Logic Syllabus for GATE, UGCNET etc.| Full Playlist for College/University Students
2.1M viewsDec 23, 2020
YouTubeGate Smashers
L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm
3:58
L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm
878.1K viewsJan 22, 2020
YouTubeGate Smashers
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
6:34
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
1.8M viewsJan 20, 2020
YouTubeGate Smashers
See more