ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

475 results

SmartLearner99
Previous  year   Gate Question Substitution  Method Algorithm with short tricks included

Substitution method example/ previous year Algorithm with short tricks included.

8:38
Previous year Gate Question Substitution Method Algorithm with short tricks included

173 views

3 years ago

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,564,731 views

5 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,148,775 views

7 years ago

Neso Academy
Asymptotic Analysis (Solved Problem 1)

Data Structures: Solved Question on Asymptotic Analysis Topics discussed: 1) Calculating the Time Complexity of the program ...

7:23
Asymptotic Analysis (Solved Problem 1)

568,595 views

5 years ago

CodeWithHarry
How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)

Learn how to calculate time complexity (Big O) of a program in hindi. these Data Structures and algorithm videos will walk you ...

46:17
How to Calculate Time Complexity of an Algorithm + Solved Questions (With Notes)

1,369,543 views

5 years ago

Gnostopedia
GATE 2013 CSIT SET-A Q7 DSA

View it here too: http://www.gnostopedia.com/gate/video/gate-13-csit-q7 Q7) Which one of the following is the tightest upper ...

2:34
GATE 2013 CSIT SET-A Q7 DSA

428 views

11 years ago

Gate Smashers
L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm

Struggling to understand the Floyd Warshall Algorithm? In this video, Varun sir will explain it in the simplest way possible—with a ...

25:31
L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm

1,086,055 views

4 years ago

Curious Bytes
Best FREE RESOURCES for GATE CSE | GATE 2025 | AIR 2 | BHAWNA CHELANI

gatecs #gate2025 #gatererources #gatelectures #selfstudy This covers GATE CS Free Resources GATE CS free study material ...

6:02
Best FREE RESOURCES for GATE CSE | GATE 2025 | AIR 2 | BHAWNA CHELANI

133,457 views

1 year 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,311,417 views

4 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,247,872 views

5 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,685,449 views

5 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

3,719,730 views

7 years ago

Engineering Funda
Booth's Algorithm Example: Basics, Steps, and Solved Problem - 1 | COA

Booth's Algorithm Example in Computer Organization & Architecture is explained with the following Timestamps: 0:00 - Booth's ...

14:59
Booth's Algorithm Example: Basics, Steps, and Solved Problem - 1 | COA

176,353 views

3 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,442,939 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,172,697 views

3 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,470,138 views

7 years ago

Curious Bytes
How I got a top rank in GATE CS 2025 | Strategy, Resources & Mistakes to Avoid #gatecs #iitbombay

iitbombay #gatecs #curiousbytes In this video, I'm talking to Dhanushk Sonkusare, who secured AIR 35 in GATE CS 2025 with a ...

23:36
How I got a top rank in GATE CS 2025 | Strategy, Resources & Mistakes to Avoid #gatecs #iitbombay

9,984 views

4 months ago

Gate Smashers
L-5.24: Optimal Page Replacement algorithm | Operating System

In this video, Varun sir will break down the Optimal Page Replacement strategy with a clear example that will make your concepts ...

13:07
L-5.24: Optimal Page Replacement algorithm | Operating System

1,765,593 views

7 years ago

Gate Smashers
L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question

In this short video, Varun sir will break down Mix Burst Time with an easy-to-understand example that makes CPU Scheduling ...

14:19
L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question

724,512 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,797,198 views

5 years ago