ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

623,396 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,616,061 views

6 years ago

People also watched

Gate Smashers
Lec-29: Cyclic Redundancy Check(CRC)  for Error Detection and Correction  | Computer Networks

Subscribe to our new channel:https://www.youtube.com/@varunainashots Cyclic Redundancy Check (CRC) is an error detection ...

12:42
Lec-29: Cyclic Redundancy Check(CRC) for Error Detection and Correction | Computer Networks

1,986,791 views

7 years ago

KnowledgeGATE by Sanchit Sir
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

KnowledgeGate Website: https://www.knowledgegate.ai For free notes on University exam's subjects, please check out our ...

9:23:20
Complete DAA Design and Analysis of Algorithm in one shot | Semester Exam | Hindi

1,355,648 views

2 years ago

Gate Smashers
Lec-13: K-mean Clustering with Numerical Example | Unsupervised Learning | Machine🖥️ Learning 🙇‍♂️🙇

K-means Clustering is a popular unsupervised learning algorithm used to group data into clusters based on similarity. In this video ...

7:51
Lec-13: K-mean Clustering with Numerical Example | Unsupervised Learning | Machine🖥️ Learning 🙇‍♂️🙇

1,102,209 views

2 years ago

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

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

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

794,863 views

6 years ago

Gate Smashers
Introduction to Uniform Cost Search (UCS) | Artificial Intelligence

Uniform Cost Search (UCS) is a powerful search algorithm used in AI and graph theory to find the least-cost path from a start ...

10:41
Introduction to Uniform Cost Search (UCS) | Artificial Intelligence

113,455 views

10 months ago

Gate Smashers
Lec-4: Breadth First Search (BFS) with example | Uninformed Search | Artificial Intelligence

Explore Breadth First Search (BFS) in a simple and practical way! In this video, Varun sir will break down how BFS works in ...

12:57
Lec-4: Breadth First Search (BFS) with example | Uninformed Search | Artificial Intelligence

2,289,207 views

6 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,237,410 views

2 years ago

Gate Smashers
Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick

Subscribe to our new channel:https://www.youtube.com/@varunainashots Pre-order traversal while duplicating nodes and values ...

6:47
Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick

2,379,047 views

7 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,010,961 views

8 years ago

Apna College
Time & Space Complexity - DSA Series by Shradha Ma'am

New DSA Sheet : https://bit.ly/dsa-sheet-apnacollege Share your DSA progress on LinkedIn : https://bit.ly/Ln-ac { #50Day DSA ...

1:25:41
Time & Space Complexity - DSA Series by Shradha Ma'am

870,576 views

1 year 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,311,329 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,104,530 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,526,877 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,085,790 views

4 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,427,464 views

4 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,524,034 views

6 years ago