ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

3,849 results

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,579,480 views

8 years ago

Gate Smashers
Lec-58: Distance vector routing algorithm in hindi | Computer Networks

Subscribe to our new channel:https://www.youtube.com/@varunainashots This video explains Distance vector routing algorithm.

26:00
Lec-58: Distance vector routing algorithm in hindi | Computer Networks

1,573,399 views

6 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

183,341 views

1 year 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,134,142 views

4 years ago

Gate Smashers
#1 LIVE TEST of Algorithm(DAA) | GATE 2022

Subscribe to our new channel:https://www.youtube.com/@varunainashots Other subject playlist Link: ...

44:50
#1 LIVE TEST of Algorithm(DAA) | GATE 2022

11,312 views

Streamed 4 years ago

Gate Smashers
L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System

Virtual Memory is a storage mechanism which offers user an illusion of having a very big main memory. It is done by treating a part ...

20:18
L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System

1,686,714 views

7 years ago

Gate Smashers
L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System

The Resource Allocation Graph, also known as RAG is a graphical representation of the state of a system. It has all the information ...

26:18
L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System

1,404,327 views

7 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

904,275 views

1 year 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,376,448 views

2 years ago

Neso Academy
Understanding the Time Complexity of an Algorithm

Algorithms: Understanding the Time Complexity of an Algorithm Topics discussed: 1. A Recap of Priori vs. Posteriori Analysis. 2.

24:59
Understanding the Time Complexity of an Algorithm

206,708 views

1 year ago

Gate Smashers
L-3.12: Solution of Readers-writers  Problem using Binary semaphore

In this video, Solution of reader writer problem is discussed using binary semaphore. Varun sir discussed about the solution of ...

21:11
L-3.12: Solution of Readers-writers Problem using Binary semaphore

627,657 views

8 years ago

Gate Smashers
L-3.16: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example

Want to know how to build a heap in just O(n) time instead of the usual O(n log n)? In this video, Varun sir will explain about the ...

21:05
L-3.16: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example

609,224 views

5 years ago

Gate Smashers
L-3.6: Direct Mapping with Example in Hindi | Cache Mapping | Computer Organisation and Architecture

In this video, you will learn the concept of Direct Mapping in Cache Memory with a simple and easy-to-follow example! Varun sir ...

22:03
L-3.6: Direct Mapping with Example in Hindi | Cache Mapping | Computer Organisation and Architecture

1,119,373 views

6 years ago

Gate Smashers
L-5.1: Memory Management and Degree of Multiprogramming | Operating System

The process of controlling and coordinating computer memory, assigning portions known as blocks to various running programs ...

23:41
L-5.1: Memory Management and Degree of Multiprogramming | Operating System

1,828,336 views

7 years ago

Abdul Bari
8. NP-Hard and NP-Complete Problems

P vs NP Satisfiability Reduction NP-Hard vs NP-Complete P=NP PATREON : https://www.patreon.com/bePatron?u=20475192 ...

31:53
8. NP-Hard and NP-Complete Problems

2,539,035 views

8 years ago

Gate Smashers
L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system

Semaphore is a variable that is non-negative and shared between threads. A semaphore is a signaling mechanism, and a thread ...

24:42
L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system

1,567,243 views

8 years ago

Abdul Bari
DDA Line Drawing Algorithm - Computer Graphics

DDA explained using Examples. DDA (Digital Differential Analyzer) Line Drawing Algorithm PATREON ...

26:48
DDA Line Drawing Algorithm - Computer Graphics

614,557 views

7 years ago

Gate Smashers
Lec-63: Insertion in Red Black Tree | Data Structure for Beginners

Subscribe to our new channel:https://www.youtube.com/@varunainashots ▻Data Structure: ...

22:52
Lec-63: Insertion in Red Black Tree | Data Structure for Beginners

290,913 views

1 year ago

3Blue1Brown
But what is quantum computing?  (Grover's Algorithm)

Qubits, state vectors, and Grover's algorithm for search. Instead of sponsored ad reads, these lessons are funded directly by ...

36:54
But what is quantum computing? (Grover's Algorithm)

3,198,841 views

10 months ago

Abdul Bari
4.9 Longest Common Subsequence (LCS)  - Recursion and Dynamic Programming

Longest Common Subsequence Problem using 1. Recursion 2. Memoization 3. Dynamic Programming PATREON ...

23:35
4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming

1,459,929 views

7 years ago