https://github.com/paulthomas20002/s4-operating-systems-lab

The course aims to offer students a hands-on experience on Operating System concepts using a constructivist approach and problem-oriented learning. Operating systems are the fundamental part of every computing device to run any type of software.
https://github.com/paulthomas20002/s4-operating-systems-lab

204 basic basic-commands cs csl csl-206 cst-204 cst-206 ktu ktu-s4 lab operating-systems-lab os os-lab s4-lab

Last synced: about 5 hours ago
JSON representation

The course aims to offer students a hands-on experience on Operating System concepts using a constructivist approach and problem-oriented learning. Operating systems are the fundamental part of every computing device to run any type of software.

• Host: GitHub
• URL: https://github.com/paulthomas20002/s4-operating-systems-lab
• Owner: PaulThomas20002
• Created: 2022-05-10T01:10:12.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-10-12T11:58:24.000Z (about 2 years ago)
• Last Synced: 2023-05-07T12:42:00.052Z (over 1 year ago)
• Topics: 204, basic, basic-commands, cs, csl, csl-206, cst-204, cst-206, ktu, ktu-s4, lab, operating-systems-lab, os, os-lab, s4-lab
• Language: C
• Homepage:
• Size: 6.14 MB
• Stars: 5
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# OPERATING-SYSTEMS-LAB

The course aims to offer students a hands-on experience on Operating System concepts using a constructivist approach and problem-oriented learning. Operating systems are the fundamental part of every computing device to run any type of software. 

Syllabus







1. Basic Linux commands 



2. Shell programming  



 -Command syntax  



 -Write simple functions with basic tests, loops, patterns 



3. System calls of Linux operating system:* 


 fork, exec, getpid, exit, wait, close, stat, opendir, readdir 



4. Write programs using the I/O system calls of Linux operating system (open, read, write)



5. Implement programs for Inter Process Communication using Shared Memory *



6. Implement Semaphores*



7. Implementation of CPU scheduling algorithms. 
a) Round Robin b) SJF c) FCFS d)

Priority *



8. Implementation of the Memory Allocation Methods for fixed partition*


a) First Fit b) Worst Fit c) Best Fit



9. Implement l page replacement algorithms
 a) FIFO b) LRU c) LFU*



10. Implement the banker’s algorithm for deadlock avoidance. *



11. Implementation of Deadlock detection algorithm



12. Simulate file allocation strategies.


b) Sequential b) Indexed c) Linked



13. Simulate disk scheduling algorithms. *


c) FCFS b)SCAN c) C-SCAN 



* mandatory








OPERATING SYSTEMS LAB - PRACTICE QUESTIONS






1. Write a program to create a process in linux.


2. Write programs using the following system calls of Linux operating system:


fork, exec, getpid, exit, wait, close, stat, opendir, readdir


3. Write programs using the I/O system calls of Linux operating system (open, read, write)


4. Given the list of processes, their CPU burst times and arrival times, display/print the

Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the

average waiting time and average turnaround time


5. Write a C program to simulate following non-preemptive CPU scheduling algorithms to

find turnaround time and waiting time.


a)FCFS b) SJF c) Round Robin (pre-emptive) d) Priority


6. Write a C program to simulate following contiguous memory allocation techniques


 a) Worst-fit b) Best-fit c) First-fit


7. Write a C program to simulate paging technique of memory management.


8. Write a C program to simulate Bankers algorithm for the purpose of deadlock avoidance.


9. Write a C program to simulate disk scheduling algorithms 
a) FCFS b) SCAN c) C-SCAN


10. Write a C program to simulate page replacement algorithms 
a) FIFO b) LRU c) LFU


11. Write a C program to simulate producer-consumer problem using semaphores.


12. Write a program for file manipulation for display a file and directory in memory.


13. Write a program to simulate algorithm for deadlock prevention.


14. Write a C program to simulate following file allocation strategies.


a)Sequential b) Indexed c) Linked