ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

433,159 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,613,869 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,100,138 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,423,676 views

4 years ago

Gate Smashers
Lec-84: RSA Algorithm in Network Security with examples in Hindi rsa algorithm example in hindi

Subscribe to our new channel:https://www.youtube.com/@varunainashots Description of RSA Algorithm in Network Security with ...

11:28
Lec-84: RSA Algorithm in Network Security with examples in Hindi rsa algorithm example in hindi

1,090,250 views

6 years 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,520,732 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,483,689 views

6 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,309,867 views

6 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,665,339 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,340,115 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,523,419 views

6 years ago

Gate Smashers
Lec-13: Hill Climbing Algorithm in Artificial Intelligence with Real Life Examples| Heuristic Search

Subscribe to our new channel:https://www.youtube.com/@varunainashots Hill Climbing Algorithm is a memory-efficient way of ...

10:14
Lec-13: Hill Climbing Algorithm in Artificial Intelligence with Real Life Examples| Heuristic Search

1,656,497 views

6 years ago

Gate Smashers
L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm)

Huffman Coding is a technique of compressing data to reduce its size without losing any of the details. It was first developed by ...

12:30
L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm)

1,928,173 views

6 years ago

Gate Smashers
L- 6.8:Topological Sorting with examples | Topological Sorting using DFS

In this video, Varun sir has discussed about Topological Sorting—a key concept in graph theory, especially useful for tasks like ...

11:33
L- 6.8:Topological Sorting with examples | Topological Sorting using DFS

581,311 views

3 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,245,387 views

3 years ago

Gate Smashers
L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal

In computer science, Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph.

9:55
L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal

2,374,069 views

4 years ago

Gate Smashers
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

In the knapsack problem, you need to pack a set of items, with given values and sizes (such as weights or volumes), into a ...

11:41
L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm

1,842,274 views

6 years ago

Gate Smashers
Lec-5: Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence

Learn how Depth First Search (DFS) works in Artificial Intelligence, explained in a simple, beginner-friendly way. Varun sir will ...

9:13
Lec-5: Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence

1,856,526 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

300,627 views

11 months ago

Gate Smashers
L-6.3: Disk Scheduling Algorithm | Operating System

Disk scheduling is done by operating systems to schedule I/O requests arriving for the disk. Disk scheduling is also known as I/O ...

6:08
L-6.3: Disk Scheduling Algorithm | Operating System

1,180,992 views

7 years ago

Gate Smashers
Lec-18: Minimax Algorithm in Game Playing | Artificial Intelligence

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

12:29
Lec-18: Minimax Algorithm in Game Playing | Artificial Intelligence

1,610,598 views

6 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,084,467 views

4 years ago

Gate Smashers
DDA Line Drawing Algorithm in Computer Graphics | Easiest Explanation with examples

In this lecture, Varun Sir explains the DDA (Digital Differential Analyzer) Line Drawing Algorithm with complete clarity and ...

9:00
DDA Line Drawing Algorithm in Computer Graphics | Easiest Explanation with examples

11,423 views

1 month ago

Gate Smashers
Lec-31: How Recursion Works in C++ Programming | C++ programming for beginners

How a function can call itself? In this video, Varun Sir will break down the recursion in C++ in the simplest way possible!

7:49
Lec-31: How Recursion Works in C++ Programming | C++ programming for beginners

22,738 views

8 months 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,175,468 views

7 years ago

Gate Smashers
Lec-9: Introduction to Decision Tree 🌲 with Real life examples

Decision Trees are among the most widely used algorithms in machine learning, ideal for both classification and regression tasks.

6:07
Lec-9: Introduction to Decision Tree 🌲 with Real life examples

1,063,822 views

2 years ago