ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

645,779 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,741,344 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,453,108 views

6 years 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,761,558 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,319,995 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,874,482 views

8 years ago

KnowledgeGATE by Sanchit Sir
Algorithm | Algo in one shot | Complete GATE Course | Hindi #withsanchitsir

KnowledgeGate Website: https://www.knowledgegate.ai For free notes on GATE/PSU/NET subjects, please check out our course: ...

11:09:54
Algorithm | Algo in one shot | Complete GATE Course | Hindi #withsanchitsir

209,414 views

1 year 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,898,760 views

6 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,511 views

7 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,784,986 views

5 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,808,274 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,604,171 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,178,779 views

5 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,127 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

441,429 views

1 year 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,445,523 views

3 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,012 views

6 months ago

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

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

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

1,211,618 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,093 views

6 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,531 views

7 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,157,269 views

8 years ago