GitHub - Vyshali2518/CSA0411.OS

Name		Name	Last commit message	Last commit date
EXP 10: IPC using Message Queue		EXP 10: IPC using Message Queue
EXP 11: Multithreading		EXP 11: Multithreading
EXP 12: Dining Philosophers Problem		EXP 12: Dining Philosophers Problem
EXP 13: Memory Allocation Strategies		EXP 13: Memory Allocation Strategies
EXP 14: Single Level Directory		EXP 14: Single Level Directory
EXP 15: Two Level Directory		EXP 15: Two Level Directory
EXP 16: Random Access File for Employee Details		EXP 16: Random Access File for Employee Details
EXP 17: Banker’s Algorithm (Deadlock Avoidance)		EXP 17: Banker’s Algorithm (Deadlock Avoidance)
EXP 18: Producer-Consumer Problem (Using Semaphores)		EXP 18: Producer-Consumer Problem (Using Semaphores)
EXP 19: Process Synchronization Using Mutex Locks		EXP 19: Process Synchronization Using Mutex Locks
EXP 1: Create a new process, get PID & PPID		EXP 1: Create a new process, get PID & PPID
EXP 20: Reader-Writer Problem (Using Semaphores)		EXP 20: Reader-Writer Problem (Using Semaphores)
EXP 21: Worst Fit Algorithm of Memory Management		EXP 21: Worst Fit Algorithm of Memory Management
EXP 22: Best Fit Algorithm of Memory Management		EXP 22: Best Fit Algorithm of Memory Management
EXP 23: First Fit Algorithm of Memory Management		EXP 23: First Fit Algorithm of Memory Management
EXP 24: UNIX System Calls for File Management		EXP 24: UNIX System Calls for File Management
EXP 25: UNIX IO System Calls (fcntl, seek, stat, opendir, readdir)		EXP 25: UNIX IO System Calls (fcntl, seek, stat, opendir, readdir)
EXP 26: File Management Operations		EXP 26: File Management Operations
EXP 27: Simulating ls UNIX Command		EXP 27: Simulating ls UNIX Command
EXP 28: Simulating grep UNIX Command		EXP 28: Simulating grep UNIX Command
EXP 29: Classical Process Synchronization Problem		EXP 29: Classical Process Synchronization Problem
EXP 2: Copy contents of one file to another		EXP 2: Copy contents of one file to another
EXP 30: Thread Related Concepts (create, join, equal, exit)		EXP 30: Thread Related Concepts (create, join, equal, exit)
EXP 31: FIFO Paging Technique		EXP 31: FIFO Paging Technique
EXP 32: Least Recently Used (LRU) Paging Technique		EXP 32: Least Recently Used (LRU) Paging Technique
EXP 33: Optimal Paging Technique		EXP 33: Optimal Paging Technique
EXP 34: File Allocation – Sequential Allocation		EXP 34: File Allocation – Sequential Allocation
EXP 35: File Allocation – Indexed Allocation		EXP 35: File Allocation – Indexed Allocation
EXP 36: File Allocation – Linked Allocation		EXP 36: File Allocation – Linked Allocation
EXP 37: FIFO Disk Scheduling Algorithm		EXP 37: FIFO Disk Scheduling Algorithm
EXP 38: SCAN Disk Scheduling Algorithm		EXP 38: SCAN Disk Scheduling Algorithm
EXP 39: C-SCAN Disk Scheduling Algorithm		EXP 39: C-SCAN Disk Scheduling Algorithm
EXP 3: FCFS CPU Scheduling		EXP 3: FCFS CPU Scheduling
EXP 40: File Access Permission & Users in Linux		EXP 40: File Access Permission & Users in Linux
EXP 4: Shortest Job First (Non-Preemptive)		EXP 4: Shortest Job First (Non-Preemptive)
EXP 5: Priority Scheduling (Non-preemptive)		EXP 5: Priority Scheduling (Non-preemptive)
EXP 6: Preemptive Priority Scheduling		EXP 6: Preemptive Priority Scheduling
EXP 7: Non-preemptive SJF		EXP 7: Non-preemptive SJF
EXP 8: Round Robin Scheduling		EXP 8: Round Robin Scheduling
EXP 9: IPC using Shared Memory		EXP 9: IPC using Shared Memory

Latest commit

History

Folders and files

About

Stars

Watchers

Forks

Releases

Packages

Contributors