Lec-5: Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence
9:13
Lec-5: Depth First Search (DFS) with example | Uninformed Search | Art…
1.9M viewsMar 31, 2019
YouTubeGate Smashers
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/NE…
3.1M viewsJan 7, 2020
YouTubeGate Smashers
Lec - 28: SR flip-flop using NAND gate | Digital Electronics
9:17
Lec - 28: SR flip-flop using NAND gate | Digital Electronics
2.3M viewsMay 23, 2022
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.13: RISC vs CISC | Computer Organization & Architecture
8:22
L-2.13: RISC vs CISC | Computer Organization & Architecture
961K viewsJan 12, 2021
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 Al…
1.1M viewsMay 26, 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 | S…
1.1M viewsSep 1, 2023
YouTubeGate Smashers
12:57
Lec-8: What is Heuristic in AI | Why we use Heuristic | How to Calculat…
1.4M viewsDec 12, 2019
YouTubeGate Smashers
7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs P…
1.6M viewsJan 8, 2020
YouTubeGate Smashers
4:40
Lec-1: Digital Logic Syllabus for GATE, UGCNET etc.| Full Playlist f…
2.1M viewsDec 23, 2020
YouTubeGate Smashers
7:40
L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | A…
1.4M viewsJan 19, 2020
YouTubeGate Smashers
18:04
Lec-1: DBMS Syllabus for GATE, UGCNET, NIELIT, DSSSB etc.| Ful…
6.1M viewsJul 18, 2018
YouTubeGate Smashers
16:32
L-4.13: Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Singl…
1M viewsApr 2, 2021
YouTubeGate Smashers
13:38
L-3.13: Heap sort with Example | Heapify Method
1.1M viewsMar 13, 2021
YouTubeGate Smashers
11:33
L- 6.8:Topological Sorting with examples | Topological Sorting us…
578K viewsSep 12, 2022
YouTubeGate Smashers
9:52
L-3.3: How Merge Sort Works?? Full explanation with example
1.4M viewsJul 28, 2022
YouTubeGate Smashers
4:03
L-3.0: Divide and Conquer | Algorithm
1.1M viewsMar 12, 2021
YouTubeGate Smashers
7:45
L-3.13: Introduction to Heap Tree with examples | Max Min Heap
1.1M viewsMar 4, 2021
YouTubeGate Smashers
8:37
Min Max Algorithm with Divide & Conquer🏆
234.1K viewsJul 1, 2023
YouTubeGate Smashers
6:07
Lec-9: Introduction to Decision Tree 🌲 with Real life examples
1.1M viewsSep 6, 2023
YouTubeGate Smashers
13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Ex…
3.3M viewsJan 20, 2020
YouTubeGate Smashers
10:26
Complete Cloud 🌧️ Computing Syllabus | Cloud Computing for Int…
303K viewsNov 21, 2024
YouTubeGate Smashers
15:06
L-5.5: Sum of Subsets Problem | Dynamic Programming
447.1K viewsApr 8, 2021
YouTubeGate Smashers
15:49
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Me…
3.4M viewsMar 29, 2021
YouTubeGate Smashers
10:23
L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Metho…
691.7K viewsSep 4, 2021
YouTubeGate Smashers
6:15
L-3.17: Deletion in Heap tree | Time complexity
427.8K viewsMar 12, 2021
YouTubeGate Smashers
12:52
L-1.6: Time Complexities of all Searching and Sorting Algorithm…
1.2M viewsDec 5, 2018
YouTubeGate Smashers
9:54
Complete Python 🐍 Syllabus 📖| Placement/interviews, College/Uni…
280.1K viewsNov 2, 2023
YouTubeGate Smashers
18:59
L-1.1: Introduction to Operating System and its Functions with En…
4.8M viewsJul 26, 2018
YouTubeGate Smashers
6:26
L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem
698.5K viewsApr 25, 2021
YouTubeGate Smashers
See more videos
Static thumbnail place holder