Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
465 results
Substitution method example/ previous year Algorithm with short tricks included.
173 views
3 years ago
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 ...
1,565,363 views
5 years ago
Data Structures: Solved Question on Asymptotic Analysis Topics discussed: 1) Calculating the Time Complexity of the program ...
568,662 views
gatecs #gate2025 #gatererources #gatelectures #selfstudy This covers GATE CS Free Resources GATE CS free study material ...
133,518 views
1 year ago
In this video, Varun sir will break down the time complexities of all major searching and sorting algorithms—perfectly tailored for ...
1,149,130 views
7 years ago
Learn how to calculate time complexity (Big O) of a program in hindi. these Data Structures and algorithm videos will walk you ...
1,369,735 views
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 ...
1,685,904 views
iitbombay #gatecs #curiousbytes In this video, I'm talking to Dhanushk Sonkusare, who secured AIR 35 in GATE CS 2025 with a ...
10,004 views
4 months ago
GATE DA 2025 Course & Test Series Visit: https://www.piyushwairale.com/ Have any questions? Join our telegram group ...
1,548 views
In this short video, Varun sir will break down Mix Burst Time with an easy-to-understand example that makes CPU Scheduling ...
724,691 views
6 years ago
Struggling to understand the Floyd Warshall Algorithm? In this video, Varun sir will explain it in the simplest way possible—with a ...
1,087,020 views
4 years ago
In this video we have discussed Practice Question on Binary Semaphore in Operating System. Varun sir will discuss various ...
468,564 views
In this video, I'm sharing a complete 7-month preparation roadmap for GATE CS 2026 — designed for those starting in July and ...
61,111 views
6 months ago
In this video, Varun sir will solve the recurrence relation T(n)= n*T(n-1) in a simplest way possible. This video will give you the ...
1,495,592 views
In this video, Varun sir will explain how Quick Sort actually works using simple examples you can easily follow. You'll understand ...
3,249,506 views
BinarySearchTree #BST #tree Subscribe to our new channel:https://www.youtube.com/@varunainashots 0:00 - Introduction ...
289,906 views
In this video, Varun sir will explain First Come First Serve (FCFS) which is an operating system scheduling algorithm that ...
3,720,737 views
Banker's algorithm is a deadlock avoidance algorithm. It is used in banking systems to determine whether a loan can be granted ...
3,471,149 views
Booth's Algorithm Example in Computer Organization & Architecture is explained with the following Timestamps: 0:00 - Booth's ...
176,505 views
In the knapsack problem, you need to pack a set of items, with given values and sizes (such as weights or volumes), into a ...
1,798,030 views
![L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm](/api/proxy/image?url=https%3A%2F%2Fi.ytimg.com%2Fvi%2FFBKjvXGGCJM%2Fsddefault.jpg)
![L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm](/api/proxy/image?url=https%3A%2F%2Fi.ytimg.com%2Fvi%2FicS-e8RaCyo%2Fsddefault.jpg)
