DSA37 - Bellman Ford Algorithm | Pseudocode | Shortest Path

DSA36 - Dijkstra Algorithm | Single Source Shortest Path | Pseudocode

DSA35 Connected Components using DFS | Pseudocode | Graph

DSA34b - Topological Sorting using DFS | Pseudocode | Graph

DSA34a - Topological Sorting | Indegree | Graph

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

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

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

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

OS31g - Solved Example 7 | Semaphore | GATE

OS49c - Solved Example 3 | Page Fault | GATE

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

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

CO53a - Solved Example | Polling, Interrupt | GATE

CO57 - Bus Arbitration | Centralized | Distributed

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

CO52c - Solved Example 3 | Hard Disk

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

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

CO37f - Solved Example 5 | Pipeline Latency | GATE

CO39f - Solved Example 2 | Branch Hazards | GATE

CO37e - Solved Example 4 | Pipeline | GATE

CO37d - Solved Example 3 | Pipeline | GATE

CO37c - Solved Example 2 | Pipeline Speedup

CO55a - Solved Examples | Processor Performance | CPI | MIPS

OS44c - Solved Example 3 | TLB | Page Table | GATE

CO55 - Processor Performance | CPI | Throughput | MIPS

CO52b - Solved Example 2 | Hard Disk Transfer Time | GATE

OS45a - Solved Example | 3-Level Page Table | GATE

CO29c - Single Bus Processor | Branch Instructions

OS17b - Solved Example 1 | Round Robin Scheduling

CO29b - Single Bus Processor | Load, Store Instructions

CO29a - Single Bus Processor | Data Transfer, Arithmetic Instructtions

CO29 - Single Bus Organization Processor | Instruction Fetch

OS49b - Solved Example 2 | Page Fault | GATE

CO52a - Solved Example 1 | Hard Disk Address | GATE

OS61b - Solved Example 1 | SSTF, FCFS Disk Scheduling | GATE

OS44b - Solved Example 2 | Page Table | GATE

OS42a - Solved Example | Memory Access | GATE

OS44a - Solved Example 1 | Page Table | GATE

OS54a - Solved Example | Page Replacement | GATE

OS59b - Solved Example 2 | Hard Disk | GATE

OS59a - Solved Example 1 | Hard Disk | GATE

OS61a - Shortest Seek Time First (SSTF) Scheduling | Hard Disk | Solved example | GATE

OS52a - Solved example | FIFO Page Replacement | GATE

OS49a - Solved Example 1 | Page Fault | GATE

OS40b - Solved Example 2 | Bankers Algorithm | GATE

OS40a - Solved Example 1 | Bankers Algorithm | GATE

OS35b - Solved Example 2 | Deadlocks | GATE

OS31f - Solved Example 6 | Mutex | GATE

OS31e - Solved Example 5 | Counting Semaphore | GATE

OS31d - Solved Example 4 | Binary Semaphore | GATE

OS31c - Solved Example 3 | Binary Semaphore | GATE

OS31b - Solved Example 2 | Binary Semaphore | GATE

OS27b - Solved Example 2 | Critical Section | GATE

OS27a - Solved Example 1 | Critical Section | GATE

OS35a - Solved Example 1 | Deadlocks | GATE

OS21a - Solved Example | Rate Monotonic Scheduling | GATE

OS17c - Solved Example 2 | Round Robin Scheduling | GATE

OS31a - Solved Example 1 | Mutex | GATE