ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

645,877 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,742,061 views

6 years ago

Gate Smashers
Lec-15: What is Heuristic in AI | Why we use Heuristic | How to Calculate Heuristic | Must Watch

Ever wondered what 'heuristic' really means in AI? In this video, Varun sir will break it down in simple words—what it is, why it's so ...

12:57
Lec-15: What is Heuristic in AI | Why we use Heuristic | How to Calculate Heuristic | Must Watch

1,464,382 views

6 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

81,170 views

6 months ago

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

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

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

2,762,008 views

7 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,247,848 views

7 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,320,820 views

6 years ago

Gate Smashers
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

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

6:34
L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm

1,899,216 views

6 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,875,067 views

8 years ago

Gate Smashers
L-2.7: Round Robin(RR) CPU Scheduling Algorithm with  Example

In this video, Varun Sir will breaks it down in the most beginner-friendly way with a real-life example to make things crystal clear!

16:23
L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example

4,152,746 views

8 years ago

Gate Smashers
Lec-18: Beam Search Algorithm | All Imp Points | Heuristic Search Techniques

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

12:02
Lec-18: Beam Search Algorithm | All Imp Points | Heuristic Search Techniques

597,038 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,431,430 views

6 years ago

Gate Smashers
Lec-23: Introduction to Game Playing | Learn Game Playing Algorithms with Example

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

7:07
Lec-23: Introduction to Game Playing | Learn Game Playing Algorithms with Example

858,850 views

7 years ago

Gate Smashers
Lec-10: Decision Tree 🌲 ID3 Algorithm with Example & Calculations 🧮

ID3 algorithm is a powerful method used to build Decision Trees for classification tasks. In this video, we'll dive into how ID3 ...

16:38
Lec-10: Decision Tree 🌲 ID3 Algorithm with Example & Calculations 🧮

1,462,587 views

2 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

441,606 views

1 year ago

Gate Smashers
Lec-11: Best First Search Algorithm | How it Works | All Imp Points(Pros & Cons)

Discover how the Best First Search Algorithm works in a simple and practical way! From its step-by-step working to key ...

14:41
Lec-11: Best First Search Algorithm | How it Works | All Imp Points(Pros & Cons)

1,719,293 views

6 years ago

Gate Smashers
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

In this video, Varun sir will explain First Come First Serve (FCFS) which is an operating system scheduling algorithm that ...

10:34
L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example

4,158,085 views

8 years ago

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

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

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

1,796,994 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,785,532 views

5 years ago

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

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

13:24
Lec-22: AO* algorithm in AI (artificial intelligence) in HINDI | AO* algorithm with example

1,102,694 views

7 years 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,559,582 views

6 years ago