ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

236 results

Dr.Gajendra Purohit
Operation Research | Two Phase Simplex Method | Linear Programming

Comment Below If This Video Helped You 💯 Like 👍 & Share With Your Classmates - ALL THE BEST 🔥 Do Visit My Second ...

18:07
Operation Research | Two Phase Simplex Method | Linear Programming

1,150,506 views

6 years ago

Dr.Gajendra Purohit
Vector Subspace  | Linearly Independent | Linearly Dependents Vectors | Linear Algebra

Comment Below If This Video Helped You 💯 Like 👍 & Share With Your Classmates - ALL THE BEST 🔥 Do Visit My Second ...

17:10
Vector Subspace | Linearly Independent | Linearly Dependents Vectors | Linear Algebra

1,302,771 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,296,105 views

5 years 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,034,528 views

5 years ago

Gate Smashers
Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure

Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 - Introduction 0:50 -When Binary Search tree is ...

10:46
Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure

1,574,775 views

5 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,384,475 views

4 years ago

Gate Smashers
Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity

Subscribe to our new channel:https://www.youtube.com/@varunainashots In computer science, a linear search or sequential ...

12:28
Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity

422,594 views

4 years ago

Professor Dave Explains
Understanding Vector Spaces

When learning linear algebra, we will frequently hear the term "vector space". What is that? What are the requirements for being ...

8:41
Understanding Vector Spaces

939,397 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,703,616 views

6 years ago

TEDx Talks
What autistic people can teach you about communication | Kalen Sieja | TEDxCU

Often portrayed as lacking communication skills, individuals on the autism spectrum actually utilize a communication style that we ...

8:11
What autistic people can teach you about communication | Kalen Sieja | TEDxCU

94,218 views

2 years ago

English with Emma · engVid
Learning English for Beginners: My top tips

Here are my tips to help beginners learn English. It can be difficult to know how to start learning a language. What are the first ...

12:19
Learning English for Beginners: My top tips

4,715,006 views

5 years ago

Vox
Why the dyslexic brain is misunderstood

How dyslexia is a differently organized brain. Subscribe and turn on notifications 🔔 so you don't miss any videos: ...

7:19
Why the dyslexic brain is misunderstood

1,602,889 views

2 years ago

TED
The magic of Fibonacci numbers | Arthur Benjamin | TED

Math is logical, functional and just ... awesome. Mathemagician Arthur Benjamin explores hidden properties of that weird and ...

6:25
The magic of Fibonacci numbers | Arthur Benjamin | TED

6,144,170 views

12 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,052,126 views

6 years ago

Dr.Gajendra Purohit
LU Decomposition Method | Numerical Methods | Solution of Linear Equation

Comment Below If This Video Helped You 💯 Like 👍 & Share With Your Classmates - ALL THE BEST 🔥 Do Visit My Second ...

19:01
LU Decomposition Method | Numerical Methods | Solution of Linear Equation

958,633 views

6 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,342,643 views

7 years ago

Gate Smashers
L-6.1: What is hashing with example | Hashing in data structure

Confused about what hashing really means? In this video, Varun sir will break down the concept of hashing in data structures in ...

5:53
L-6.1: What is hashing with example | Hashing in data structure

2,277,496 views

5 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,215,040 views

3 years ago

Gate Smashers
L-4.5: Job Sequencing Algorithm with Example | Greedy Techniques

The sequencing of jobs on a single processor with deadline constraints is called as Job Sequencing with Deadlines. Here- You ...

10:39
L-4.5: Job Sequencing Algorithm with Example | Greedy Techniques

900,489 views

6 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,822,755 views

6 years ago