Все публикации

0:18:31

DSA37 - Bellman Ford Algorithm | Pseudocode | Shortest Path

0:21:47

DSA36 - Dijkstra Algorithm | Single Source Shortest Path | Pseudocode

0:11:45

DSA35 Connected Components using DFS | Pseudocode | Graph

0:13:00

DSA34b - Topological Sorting using DFS | Pseudocode | Graph

0:08:11

DSA34a - Topological Sorting | Indegree | Graph

0:08:41

DSA33b - Prim's Algorithm | Pseudocode | Minimum Spanning Tree

0:11:13

DSA33a - Kruskal's Algorithm | Pseudocode | Minimum Spanning Tree

0:12:19

DSA33 - Spanning Tree | Minimum Spanning Tree (MST) | Cut Property

0:02:56

CO49j - Solved Example 7 | Set Associative Cache Mapping | GATE

0:09:32

OS31g - Solved Example 7 | Semaphore | GATE

0:07:35

OS49c - Solved Example 3 | Page Fault | GATE

0:09:09

OS45b - Solved Example | Multi-level Page Table | GATE

0:06:54

CO15a - Solved Example | Multiplication of Floating Point Numbers | GATE

0:03:21

CO53a - Solved Example | Polling, Interrupt | GATE

0:18:28

CO57 - Bus Arbitration | Centralized | Distributed

0:16:11

DSA32b - Depth First Search (DFS) Traversal | Pseudocode | Graph Traversal

0:04:01

CO52c - Solved Example 3 | Hard Disk

0:13:30

DSA32a - Breadth First Search (BFS) Traversal | Pseudocode | Graph Traversal

0:16:00

CO56 - Memory Interleaving | High-order | Low-order

0:03:21

CO37f - Solved Example 5 | Pipeline Latency | GATE

0:02:33

CO39f - Solved Example 2 | Branch Hazards | GATE

0:04:00

CO37e - Solved Example 4 | Pipeline | GATE

0:03:04

CO37d - Solved Example 3 | Pipeline | GATE

0:02:27

CO37c - Solved Example 2 | Pipeline Speedup