ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

627,470 results

Gate Smashers
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

In this video, Varun sir will break down the basics of what an algorithm is and why it's so important in computer science. You'll also ...

7:51
L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA

1,639,687 views

6 years ago

Gate Smashers
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

In this session, Varun sir will introduce you to the world of Design and Analysis of Algorithms (DAA) — a crucial subject for GATE, ...

11:27
L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA

3,202,973 views

6 years ago

Gate Smashers
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Artificial Intelligence (Complete Playlist): ...

14:34
Lec-14: A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

2,580,483 views

6 years ago

Gate Smashers
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

In this video, Varun sir will simplify the most important concepts in Algorithm Analysis – Big O, Big Omega (Ω), and Theta (Θ) ...

14:25
L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm

3,147,030 views

6 years ago

Gate Smashers
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...

13:27
L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer

3,381,432 views

6 years ago

Gate Smashers
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

n this video, Varun sir will explain Dijkstra's Algorithm step-by-step to help you understand how it finds the shortest path from a ...

15:49
L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

3,454,776 views

4 years ago

Gate Smashers
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

Greedy techniques are one of the most intuitive and powerful problem-solving approaches in algorithms. In this video, Varun sir ...

7:32
L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques

1,327,913 views

6 years ago

Gate Smashers
Lec - 18: Apriori Algorithm in Data Mining | Real Life Example

The Apriori algorithm is a key technique in data mining used to identify frequent itemsets and generate association rules from ...

12:59
Lec - 18: Apriori Algorithm in Data Mining | Real Life Example

316,096 views

1 year ago

Gate Smashers
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm

A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, undirected graph is a spanning tree ...

11:17
L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm

2,545,374 views

6 years ago

Gate Smashers
L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm

A spanning tree is a sub-graph of an undirected connected graph, which includes all the vertices of the graph with a minimum ...

7:12
L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm

1,497,133 views

6 years ago

Gate Smashers
L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA

In this video, Varun sir will discuss Breadth First Search (BFS) and Depth First Search (DFS)—two fundamental graph traversal ...

11:16
L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA

2,265,486 views

3 years ago

Gate Smashers
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

In this video, Varun sir will break down the time complexities of all major searching and sorting algorithms—perfectly tailored for ...

12:52
L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams

1,190,358 views

7 years ago

Gate Smashers
L-3.0: Divide and Conquer | Algorithm

How complex problems are solved efficiently in computer science? In this video, Varun sir will explain about Divide and Conquer ...

4:03
L-3.0: Divide and Conquer | Algorithm

1,103,070 views

5 years ago

Abdul Bari
1.5.1 Time Complexity #1

Finding Time Complexity of Different kind of snippets PATREON : https://www.patreon.com/bePatron?u=20475192 Courses on ...

9:44
1.5.1 Time Complexity #1

3,035,304 views

8 years ago

Gate Smashers
L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles

Banker's algorithm is a deadlock avoidance algorithm. It is used in banking systems to determine whether a loan can be granted ...

24:04
L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles

3,578,211 views

8 years ago

Gate Smashers
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

In this video, Varun sir will explain what a recurrence relation is, how to write one for Binary Search, and most importantly — how ...

7:15
L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them

1,694,848 views

6 years ago

Gate Smashers
Lec - 22: Clustering in Data Mining Explained | Top Clustering Methods You MUST Know!

Clustering methods in data mining are techniques used to group similar data points into clusters, helping to uncover hidden ...

6:40
Lec - 22: Clustering in Data Mining Explained | Top Clustering Methods You MUST Know!

115,652 views

11 months ago

Gate Smashers
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c]  | Substitution Method | Algorithm

In this video, Varun sir will solve the recurrence relation T(n)= T(n/2) + c in a simplest way possible. This video will give you the ...

5:38
L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm

1,439,383 views

6 years ago

Gate Smashers
Lec - 19: Frequent Pattern Growth Algorithm | How to create FP Tree

The Frequent Pattern Growth (FP-growth) algorithm is an efficient method in data mining used to discover frequent itemsets ...

14:10
Lec - 19: Frequent Pattern Growth Algorithm | How to create FP Tree

159,431 views

11 months ago

Gate Smashers
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

Confused between Greedy Algorithms and Dynamic Programming? In this video, Varun sir will explain the key differences with ...

9:08
L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)

1,054,731 views

6 years ago