Канал: EZCSE

DSA37 - Bellman Ford Algorithm | Pseudocode | Shortest Path

DSA37 - Bellman Ford Algorithm | Pseudocode | Shortest Path

DSA36 - Dijkstra Algorithm | Single Source Shortest Path | Pseudocode

DSA36 - Dijkstra Algorithm | Single Source Shortest Path | Pseudocode

DSA35 Connected Components using DFS | Pseudocode | Graph

DSA35 Connected Components using DFS | Pseudocode | Graph

DSA34b - Topological Sorting using DFS | Pseudocode | Graph

DSA34b - Topological Sorting using DFS | Pseudocode | Graph

DSA34a - Topological Sorting | Indegree | Graph

DSA34a - Topological Sorting | Indegree | Graph

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

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

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

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

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

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

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

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

OS31g - Solved Example 7 | Semaphore | GATE

OS31g - Solved Example 7 | Semaphore | GATE

OS49c - Solved Example 3 | Page Fault | GATE

OS49c - Solved Example 3 | Page Fault | GATE

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

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

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

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

CO53a - Solved Example | Polling, Interrupt | GATE

CO53a - Solved Example | Polling, Interrupt | GATE

CO57 - Bus Arbitration | Centralized | Distributed

CO57 - Bus Arbitration | Centralized | Distributed

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

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

CO52c - Solved Example 3 | Hard Disk

CO52c - Solved Example 3 | Hard Disk

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

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

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

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

CO37f - Solved Example 5 | Pipeline Latency | GATE

CO37f - Solved Example 5 | Pipeline Latency | GATE

CO39f - Solved Example 2 | Branch Hazards | GATE

CO39f - Solved Example 2 | Branch Hazards | GATE

CO37e - Solved Example 4 | Pipeline | GATE

CO37e - Solved Example 4 | Pipeline | GATE

CO37d - Solved Example 3 | Pipeline | GATE

CO37d - Solved Example 3 | Pipeline | GATE

CO37c - Solved Example 2 | Pipeline Speedup

CO37c - Solved Example 2 | Pipeline Speedup

CO55a - Solved Examples | Processor Performance | CPI | MIPS

CO55a - Solved Examples | Processor Performance | CPI | MIPS

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

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

CO55 - Processor Performance | CPI | Throughput | MIPS

CO55 - Processor Performance | CPI | Throughput | MIPS

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

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

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

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

CO29c - Single Bus Processor | Branch Instructions

CO29c - Single Bus Processor | Branch Instructions

OS17b - Solved Example 1 | Round Robin Scheduling

OS17b - Solved Example 1 | Round Robin Scheduling

CO29b - Single Bus Processor | Load, Store Instructions

CO29b - Single Bus Processor | Load, Store Instructions

CO29a - Single Bus Processor | Data Transfer, Arithmetic Instructtions

CO29a - Single Bus Processor | Data Transfer, Arithmetic Instructtions

CO29 - Single Bus Organization Processor | Instruction Fetch

CO29 - Single Bus Organization Processor | Instruction Fetch

OS49b - Solved Example 2 | Page Fault | GATE

OS49b - Solved Example 2 | Page Fault | GATE

CO52a - Solved Example 1 | Hard Disk Address | GATE

CO52a - Solved Example 1 | Hard Disk Address | GATE

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

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

OS44b - Solved Example 2 | Page Table | GATE

OS44b - Solved Example 2 | Page Table | GATE

OS42a - Solved Example | Memory Access | GATE

OS42a - Solved Example | Memory Access | GATE

OS44a - Solved Example 1 | Page Table | GATE

OS44a - Solved Example 1 | Page Table | GATE

OS54a - Solved Example | Page Replacement | GATE

OS54a - Solved Example | Page Replacement | GATE

OS59b - Solved Example 2 | Hard Disk | GATE

OS59b - Solved Example 2 | Hard Disk | GATE

OS59a - Solved Example 1 | Hard Disk | GATE

OS59a - Solved Example 1 | Hard Disk | GATE

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

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

OS52a - Solved example | FIFO Page Replacement | GATE

OS52a - Solved example | FIFO Page Replacement | GATE

OS49a - Solved Example 1 | Page Fault | GATE

OS49a - Solved Example 1 | Page Fault | GATE

OS40b - Solved Example 2 | Bankers Algorithm | GATE

OS40b - Solved Example 2 | Bankers Algorithm | GATE

OS40a - Solved Example 1 | Bankers Algorithm | GATE

OS40a - Solved Example 1 | Bankers Algorithm | GATE

OS35b - Solved Example 2 | Deadlocks | GATE

OS35b - Solved Example 2 | Deadlocks | GATE

OS31f - Solved Example 6 | Mutex | GATE

OS31f - Solved Example 6 | Mutex | GATE

OS31e - Solved Example 5 | Counting Semaphore | GATE

OS31e - Solved Example 5 | Counting Semaphore | GATE

OS31d - Solved Example 4 | Binary Semaphore | GATE

OS31d - Solved Example 4 | Binary Semaphore | GATE

OS31c - Solved Example 3 | Binary Semaphore | GATE

OS31c - Solved Example 3 | Binary Semaphore | GATE

OS31b - Solved Example 2 | Binary Semaphore | GATE

OS31b - Solved Example 2 | Binary Semaphore | GATE

OS27b - Solved Example 2 | Critical Section | GATE

OS27b - Solved Example 2 | Critical Section | GATE

OS27a - Solved Example 1 | Critical Section | GATE

OS27a - Solved Example 1 | Critical Section | GATE

OS35a - Solved Example 1 | Deadlocks | GATE

OS35a - Solved Example 1 | Deadlocks | GATE

OS21a - Solved Example | Rate Monotonic Scheduling | GATE

OS21a - Solved Example | Rate Monotonic Scheduling | GATE

OS17c - Solved Example 2 | Round Robin Scheduling | GATE

OS17c - Solved Example 2 | Round Robin Scheduling | GATE

OS31a - Solved Example 1 | Mutex | GATE

OS31a - Solved Example 1 | Mutex | GATE

OS16f - Solved Example | Longest Remaining Time Scheduling | GATE

OS16f - Solved Example | Longest Remaining Time Scheduling | GATE

OS16e - Solved Example 2 | Shortest Remaining Time | GATE

OS16e - Solved Example 2 | Shortest Remaining Time | GATE

OS16c - Solved Example | Preemptive Shortest Job First (SJF) | GATE

OS16c - Solved Example | Preemptive Shortest Job First (SJF) | GATE

OS6b - Parent-Child Process | fork() | Solved Example | GATE

OS6b - Parent-Child Process | fork() | Solved Example | GATE

OS16d - Solved Example 1 | Shortest Remaining Time First Scheduling | GATE

OS16d - Solved Example 1 | Shortest Remaining Time First Scheduling | GATE

OS6a - Solved Example | fork() | GATE

OS6a - Solved Example | fork() | GATE

OS69 - Indexed Allocation | File Storage

OS69 - Indexed Allocation | File Storage

OS68 - Linked Allocation | FAT | File Storage

OS68 - Linked Allocation | FAT | File Storage

OS67 - Contiguous Allocation | File Storage

OS67 - Contiguous Allocation | File Storage

OS66 - Directory Implementation

OS66 - Directory Implementation

OS65 - Directory Structure

OS65 - Directory Structure

OS64 - File operations | File access

OS64 - File operations | File access

OS63 - Introduction to Files | Directory

OS63 - Introduction to Files | Directory

OS62 - C-SCAN Disk Scheduling

OS62 - C-SCAN Disk Scheduling

OS61 - SCAN Disk Scheduling

OS61 - SCAN Disk Scheduling

OS60 - FCFS Disk Scheduling | Disk Scheduling

OS60 - FCFS Disk Scheduling | Disk Scheduling

OS59 - Hard Disk Drive | Disk Scheduling

OS59 - Hard Disk Drive | Disk Scheduling

OS58 - Kernel Memory Allocation | Buddy System

OS58 - Kernel Memory Allocation | Buddy System

OS57 - Thrashing | Working Set

OS57 - Thrashing | Working Set

OS56 - Global vs Local Page Replacement | Operating Systems

OS56 - Global vs Local Page Replacement | Operating Systems

OS55 - Frame Allocation | Operating Systems

OS55 - Frame Allocation | Operating Systems

OS54 - Optimal Page Replacement Algorithm

OS54 - Optimal Page Replacement Algorithm

OS53 - Least Recently Used (LRU) Page Replacement Algorithm

OS53 - Least Recently Used (LRU) Page Replacement Algorithm

OS52 - FIFO Page Replacement Algorithm | Belady's Anomaly

OS52 - FIFO Page Replacement Algorithm | Belady's Anomaly

OS51 - Page Replacement | Dirty Bit

OS51 - Page Replacement | Dirty Bit

OS50 - Copy on Write | Operating Systems

OS50 - Copy on Write | Operating Systems

OS49 - Virtual Memory | Demand Paging | Page Fault

OS49 - Virtual Memory | Demand Paging | Page Fault

OS48 - Swapping in Operating Systems

OS48 - Swapping in Operating Systems

OS47 - Inverted page table

OS47 - Inverted page table

OS46 - Hashed Page Table

OS46 - Hashed Page Table

OS45 - Hierarchical (Multi-level) Page Table | Two-level Page Table

OS45 - Hierarchical (Multi-level) Page Table | Two-level Page Table

OS44 - Paging | Page Table | TLB

OS44 - Paging | Page Table | TLB

OS43 - Contiguous Memory Allocation | Fragmentation

OS43 - Contiguous Memory Allocation | Fragmentation

OS42 - Memory Management Unit | MMU

OS42 - Memory Management Unit | MMU

OS41 - Deadlock Recovery | Operating Systems

OS41 - Deadlock Recovery | Operating Systems

OS40 - Banker's Algorithm | Deadlock Avoidance | Solved Example

OS40 - Banker's Algorithm | Deadlock Avoidance | Solved Example

OS39 - Deadlock Avoidance using Resource Allocation Graph

OS39 - Deadlock Avoidance using Resource Allocation Graph

OS38 - Deadlock Avoidance | Safe State

OS38 - Deadlock Avoidance | Safe State

OS37 - Deadlock Handling | Deadlock Prevention

OS37 - Deadlock Handling | Deadlock Prevention

OS36 - Resource Allocation Graph (RAG) | Deadlocks

OS36 - Resource Allocation Graph (RAG) | Deadlocks

OS35 - Deadlocks | Operating System

OS35 - Deadlocks | Operating System

OS34a - Dining Philosophers Problem with Monitors

OS34a - Dining Philosophers Problem with Monitors

OS34 - Dining Philosophers Problem with Semaphores

OS34 - Dining Philosophers Problem with Semaphores

OS33 - Monitors | Synchronization

OS33 - Monitors | Synchronization

OS32 - Readers Writers Problem

OS32 - Readers Writers Problem

OS31 - Semaphores | Bounded Buffer

OS31 - Semaphores | Bounded Buffer

OS30 - Mutex Lock

OS30 - Mutex Lock

OS29 - Test and Set Instruction | Hardware Synchronization

OS29 - Test and Set Instruction | Hardware Synchronization

OS28 - Peterson's Solution | Critical Section | Synchronization

OS28 - Peterson's Solution | Critical Section | Synchronization

OS27 - Synchronization | Race Condition | Critical Section | Producer-Consumer Problem

OS27 - Synchronization | Race Condition | Critical Section | Producer-Consumer Problem

OS26 - Multithreading Models | User Threads | Kernel Threads

OS26 - Multithreading Models | User Threads | Kernel Threads

OS25 - Introduction to Threads

OS25 - Introduction to Threads

OS24 - Pipes | Interprocess Communication

OS24 - Pipes | Interprocess Communication

OS23 - Interprocess Communication | Shared Memory | Message Passing | Signals

OS23 - Interprocess Communication | Shared Memory | Message Passing | Signals

OS22 - Earliest Deadline First (EDF) Scheduling | Real Time Process

OS22 - Earliest Deadline First (EDF) Scheduling | Real Time Process

OS21 - Rate Monotonic Scheduling | Real Time Process

OS21 - Rate Monotonic Scheduling | Real Time Process

OS20 - Scheduling Real Time Process

OS20 - Scheduling Real Time Process

OS19b - Solved example | Multilevel Feedback Queue Scheduling

OS19b - Solved example | Multilevel Feedback Queue Scheduling

OS19a - Multilevel, Multilevel Feedback Scheduling

OS19a - Multilevel, Multilevel Feedback Scheduling

OS18b - Preemptive Priority Scheduling | Solved Example

OS18b - Preemptive Priority Scheduling | Solved Example

OS18a - Non-preemptive Priority Scheduling | Solved Example

OS18a - Non-preemptive Priority Scheduling | Solved Example

OS17a - Introduction to Round Robin (RR) Scheduling

OS17a - Introduction to Round Robin (RR) Scheduling

OS16b - Preemptive Shortest Job First (SJF) | Solved Example

OS16b - Preemptive Shortest Job First (SJF) | Solved Example

OS16a - Non-preemptive Shortest Job First (SJF) | Solved Example

OS16a - Non-preemptive Shortest Job First (SJF) | Solved Example

OS15 - First Come First Served (FCFS) Scheduling | Convoy Effect | Solved Example

OS15 - First Come First Served (FCFS) Scheduling | Convoy Effect | Solved Example

OS14 - CPU Scheduling Criteria

OS14 - CPU Scheduling Criteria

OS13 - CPU Scheduler and Dispatcher

OS13 - CPU Scheduler and Dispatcher

OS12 - Context Switch

OS12 - Context Switch

OS11 - Process Scheduling

OS11 - Process Scheduling

OS10 - Process Control Block

OS10 - Process Control Block

OS9 - Process State

OS9 - Process State

OS8a - Process Creation and Termination

OS8a - Process Creation and Termination

OS8 - Introduction to Process

OS8 - Introduction to Process

OS7 - System Calls | open( ), read( ), write( ), close( ), dup( )

OS7 - System Calls | open( ), read( ), write( ), close( ), dup( )

OS6 - System Calls | exec( ), exit( ), fork( )

OS6 - System Calls | exec( ), exit( ), fork( )

OS5 - File Descriptors, File Descriptor Table

OS5 - File Descriptors, File Descriptor Table

OS4 - File System, Shell, System Calls

OS4 - File System, Shell, System Calls

OS3 - Functions of an Operating System

OS3 - Functions of an Operating System

OS2 - Dual Mode of Operating System

OS2 - Dual Mode of Operating System

OS1 - Introduction to Operating Systems

OS1 - Introduction to Operating Systems

CO53 - Interrupts, Traps

CO53 - Interrupts, Traps

CO52f - Solved example 6 | DMA | GATE

CO52f - Solved example 6 | DMA | GATE

CO52e - Solved example 5 | Hard disk | GATE

CO52e - Solved example 5 | Hard disk | GATE

CO52d - Solved example 4 | Hard Disk | GATE

CO52d - Solved example 4 | Hard Disk | GATE

CO39e - Solved example | Branch penalty | GATE

CO39e - Solved example | Branch penalty | GATE

CO38f - Solved Example 1 | Operand Forwarding | GATE

CO38f - Solved Example 1 | Operand Forwarding | GATE

CO37b - Solved Example 1 | Pipeline Speedup | GATE

CO37b - Solved Example 1 | Pipeline Speedup | GATE

CO49h - Solved example 5 | Set associative mapping | GATE

CO49h - Solved example 5 | Set associative mapping | GATE

CO49g - Solved example 4 | Direct mapping | GATE

CO49g - Solved example 4 | Direct mapping | GATE

CO49f - Solved example 3 | Direct mapping | GATE

CO49f - Solved example 3 | Direct mapping | GATE

CO49i - Solved example 6 | Set associative cache mapping | GATE

CO49i - Solved example 6 | Set associative cache mapping | GATE

CO49e - Solved example 2 | Set associative mapping | GATE

CO49e - Solved example 2 | Set associative mapping | GATE

CO49d - Solved example 1 | Direct mapping | GATE, ISRO

CO49d - Solved example 1 | Direct mapping | GATE, ISRO

CO48j - Solved example 6 | Cache | GATE

CO48j - Solved example 6 | Cache | GATE

CO48i - Solved example 5 | Cache | GATE

CO48i - Solved example 5 | Cache | GATE

CO48h - Solved example 4 | Cache | GATE

CO48h - Solved example 4 | Cache | GATE

CO48g - Solved example 3 | Cache | GATE

CO48g - Solved example 3 | Cache | GATE

CO48f - Solved example 2 | Cache | GATE

CO48f - Solved example 2 | Cache | GATE

CO4b - Solved example | Address bus | GATE

CO4b - Solved example | Address bus | GATE

CO42b - Solved example 2 | RAM organization| ISRO

CO42b - Solved example 2 | RAM organization| ISRO

CO48e - Solved example 1 | Cache | GATE

CO48e - Solved example 1 | Cache | GATE

CO44b Solved example | Dynamic memory refresh rate | GATE

CO44b Solved example | Dynamic memory refresh rate | GATE

CO42a - Solved example 1 | RAM | GATE

CO42a - Solved example 1 | RAM | GATE

CO36a - Solved example | Microprogrammed control | GATE, UGC-NET

CO36a - Solved example | Microprogrammed control | GATE, UGC-NET

CO35b - Solved example | Hardwired control signal | GATE

CO35b - Solved example | Hardwired control signal | GATE

CO24h - Solved example 2 | PC-relative Addressing | GATE

CO24h - Solved example 2 | PC-relative Addressing | GATE

CO30d - Solved Example 2 | Program execution | GATE

CO30d - Solved Example 2 | Program execution | GATE

CO30c - Solved example 1 | Program execution | GATE

CO30c - Solved example 1 | Program execution | GATE

CO24g - Solved example 1 | Index, Indirect Addressing | GATE

CO24g - Solved example 1 | Index, Indirect Addressing | GATE

CO32a - Datapath, Address Generator, Processor - Memory Interface

CO32a - Datapath, Address Generator, Processor - Memory Interface

CO23e - Solved example 5 | Instruction Set Architecture | GATE

CO23e - Solved example 5 | Instruction Set Architecture | GATE

CO23d - Solved example 4 | Instruction Set Architecture | GATE

CO23d - Solved example 4 | Instruction Set Architecture | GATE

CO23c - Solved example 3 | Instruction Set Architecture | GATE, ISRO

CO23c - Solved example 3 | Instruction Set Architecture | GATE, ISRO

CO23b - Solved example 2 | Instruction Set Architecture | GATE

CO23b - Solved example 2 | Instruction Set Architecture | GATE

CO23a - Solved example 1 | Instruction Set Architecture | GATE

CO23a - Solved example 1 | Instruction Set Architecture | GATE

CO18a - Solved example | Program Status Word, Flags | GATE, ISRO

CO18a - Solved example | Program Status Word, Flags | GATE, ISRO

CO12a - Solved example | Booth algorithm | GATE

CO12a - Solved example | Booth algorithm | GATE

CO12 - Multiplication of signed operands | Booth Recoded Multiplier

CO12 - Multiplication of signed operands | Booth Recoded Multiplier

DSA31e - Solved Example 2 | Deletion of element in B Tree

DSA31e - Solved Example 2 | Deletion of element in B Tree

DSA31d - Solved Example 1 | Deletion of element in B Tree

DSA31d - Solved Example 1 | Deletion of element in B Tree

DSA31c - Solved examples - Insertion in B Tree

DSA31c - Solved examples - Insertion in B Tree

DSA31b - Insertion of element in B Tree

DSA31b - Insertion of element in B Tree

DSA31a - Introduction to M-way Tree, B Tree

DSA31a - Introduction to M-way Tree, B Tree

DSA30d - Solved Example - Deletion in AVL Tree

DSA30d - Solved Example - Deletion in AVL Tree

DSA24b - Implementation of linked representation of binary tree

DSA24b - Implementation of linked representation of binary tree

DSA30c - Deletion in AVL Tree | R0, R1, R-1 | L0, L1, L-1 rotations

DSA30c - Deletion in AVL Tree | R0, R1, R-1 | L0, L1, L-1 rotations

DSA30b - AVL Tree Rotations Solved Examples

DSA30b - AVL Tree Rotations Solved Examples

DSA30a - Introduction to AVL Tree | Rotations

DSA30a - Introduction to AVL Tree | Rotations

DSA29g - Inorder successor of node in Binary Search Tree

DSA29g - Inorder successor of node in Binary Search Tree

DSA29f - Find minimum, maximum in Binary Search Tree

DSA29f - Find minimum, maximum in Binary Search Tree

DSA29e - Delete a node in Binary Search Tree

DSA29e - Delete a node in Binary Search Tree

DSA29d - Insert a node in Binary Search Tree

DSA29d - Insert a node in Binary Search Tree

DSA29c - Search a Binary Search Tree

DSA29c - Search a Binary Search Tree

DSA29b - Create a Binary Search Tree

DSA29b - Create a Binary Search Tree

DSA29a - Introduction to Binary Search Tree

DSA29a - Introduction to Binary Search Tree

DSA28c - Graph representation | Adjacency list

DSA28c - Graph representation | Adjacency list

DSA28b - Graph representation | Adjacency matrix

DSA28b - Graph representation | Adjacency matrix

DSA28a - Graph representation

DSA28a - Graph representation

DSA27f - Biconnected graph, bridges

DSA27f - Biconnected graph, bridges

DSA27e - Transitive closure of graph

DSA27e - Transitive closure of graph