-
The commands used in this lab are listed in the file linux_commands.md.
-
- WAP in C to simulate FCFS CPU Scheduling Algorithm
- WAP in C to simulate SJF CPU Scheduling Algorithm
- WAP in C to simulate SRTF CPU Scheduling Algorithm
- WAP in C to simulate Round Robin CPU Scheduling Algorithm
- WAP in C to simulate Non-Preemptive Priority Scheduling Algorithm
- WAP in C to simulate Preemptive Priority Scheduling Algorithm
-
(Output screen should contain both positive and negative instances)
- WAP to implement Bankers Algorithm for multiple type of resources to decide safe/unsafe state.
- WAP for deadlock detection in the system having multiple type of resources. ( The program should list the deadlocked process in case of deadlock detection results true )
-
- WAP in C to simulate FIFO Page Replacement Algorithm
- WAP in C to simulate Optimal Page Replacement Algorithm
- WAP in C to simulate LRU Page Replacement Algorithm
- WAP in C to simulate Second Chance Page Replacement Algorithm
- WAP in C to simulate LFU Page Replacement Algorithm
-
- WAP to simulate Contiguous File Allocation Technique
- WAP to simulate Linked File Allocation Technique
- WAP to simulate File Allocation using File Allocation Table
- WAP to implement File Allocation using Inode
-
- WAP to simulate Free Space Management using Bitmaps
- WAP to simulate Free Space Management using Linked List
-
- WAP to simulate FCFS Disk Scheduling Algorithm
- WAP to simulate SSTF Disk Scheduling Algorithm
- WAP to simulate SCAN Disk Scheduling Algorithm
- WAP to simulate C-SCAN Disk Scheduling Algorithm
- WAP to simulate LOOK Disk Scheduling Algorithm
- WAP to simulate C-LOOK Disk Scheduling Algorith
./OS
├── 1_linux_commands.md
|
├── 2_process_creation_and_termination.c
|
├── 3_thread_creation_and_termination.c
|
├── 4_IPC_techniques
│ ├── a_shared_memory_concept.c
│ └── b_message_passing_concept.c
|
├── 5_Process_scheduling_algorithms
│ ├── a_fcfs.c
│ ├── b_sjf.c
│ ├── c_srtf.c
│ ├── d_round_robin.c
│ ├── e_non_preemptive_priority.c
│ └── f_preemptive_priority.c
|
├── 6_Deadlock_avoidance_and_deadlock_detection_algorithms
│ ├── a_bankers_algorithm.c
│ └── b_deadlock_detection.c
|
├── 7_Page_replacement_algorithms
│ ├── a_fifo.c
│ ├── b_optimal.c
│ ├── c_lru.c
│ ├── d_second_chance.c
│ └── e_lfu.c
|
├── 8_File_allocation_techniques
│ ├── a_contiguous.c
│ ├── b_linked.c
│ ├── c_fat.c
│ └── d_inode.c
|
├── 9_Free_space_management_techniques
│ ├── a_bitmap.c
│ └── b_linked_list.c
|
├── 10_Disk_scheduling_algorithms
│ ├── a_fcfs.c
│ └── b_sstf.c
│ └── c_scan.c
│ └── d_cscan.c
│ └── e_look.c
│ └── f_clook.c
.