ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

4,017 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,875,022 views

8 years ago

Gate Smashers
L-3.4: Critical Section Problem |  Mutual Exclusion, Progress and Bounded Waiting | Operating System

The critical section problem is used to design a protocol followed by a group of processes, so that when one process has entered ...

25:36
L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System

1,723,305 views

8 years ago

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

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

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

1,679,889 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

209,615 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 & guidance webinars, please check out our course: ...

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

1,529,897 views

2 years ago

Gate Smashers
L-5.9: What is Paging | Memory management |  Operating System

In this video, you will understand the full concept of Paging which is most popular topic in memory management. Paging is a ...

25:54
L-5.9: What is Paging | Memory management | Operating System

2,576,663 views

8 years ago

Gate Smashers
Lec-32: Lossless and Lossy Decomposition| Fifth (5th) Normal Form  | Database Management System

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

22:17
Lec-32: Lossless and Lossy Decomposition| Fifth (5th) Normal Form | Database Management System

1,239,845 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,653,113 views

8 years ago

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

Gate Smashers Shorts: Watch quick concepts & short videos here: https://www.youtube.com/@GateSmashersShorts Subscribe ...

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

333,488 views

1 year 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,512,970 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

649,955 views

5 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,769,186 views

8 years ago

Gate Smashers
L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System

In this video, Varun sir will discuss about the Producer-Consumer problem. The Producer-Consumer problem is a classic ...

26:36
L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System

1,674,370 views

8 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

235,628 views

1 year ago

Gate Smashers
L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System

Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some ...

24:49
L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System

1,645,964 views

8 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,273,841 views

5 years ago

Gate Smashers
L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System

In this video, Varun sir will break down the concept in a simple and visual way — using a clear example to show how processes ...

21:42
L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System

870,382 views

8 years 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

665,109 views

8 years ago

GATE Applied Course
Master theorem | Solving Recurrences | Data Structure & Algorithm | GATE APPLIED COURSE

datastructure #algorithm #mastertheorem #gatecs2022 #ds #algo #dsalgo Subject Name: Data Structures and Algorithms ...

20:46
Master theorem | Solving Recurrences | Data Structure & Algorithm | GATE APPLIED COURSE

173,723 views

7 years ago

Learn Coding
Algorithm Complexity(Time & Space) | Learn Coding

Data Structure & Algorithms Complete tutorials for Beginners.

26:12
Algorithm Complexity(Time & Space) | Learn Coding

571,832 views

2 years ago