Skip to content

Latest commit

Β 

History

History
59 lines (42 loc) Β· 2.5 KB

README.md

File metadata and controls

59 lines (42 loc) Β· 2.5 KB

Operating Systems Lab (ETCS-352)

Experiments for Operating Systems Lab (ETCS-352) performed by me in 2021 at uni.

Topics Covered 🌟

  1. Job scheduling in Operating System
  2. First Come First Serve Scheduling
  3. Shortest Job First Scheduling
  4. Shortest Remaining Time First Scheduling
  5. Priority Scheduling
  6. Premptive Priority Scheduling
  7. Non Premptive Priority Scheduling
  8. Round Robin Scheduling
  9. Page Replacement Algorithm
  10. First In First Out Page Replacement Algorithm
  11. Optimal Page Replacement Algorithm
  12. Least Recently Used Page Replacement Algorithm (LRU)
  13. Bankers Algorithm
  14. Reader Writter Problem
  15. Partitioning
  16. Memory partitioning
  17. First Fit Memory partitioning
  18. Best Fit Memory partitioning
  19. Worst Fit Memory partitioning

Table of Contents

  1. First Come First Serve Scheduling - Code

  2. Shortest Job First Scheduling - Code

  3. Shortest Remaining Time First Scheduling - Code

  4. Priority Scheduling - Premptive | Non Premptive

  5. Round Robin Scheduling - Code

  6. Page Replacement Algorithm - Code

  7. Bankers Algorithm - Code

  8. Reader Writter Problem - Code

  9. Partitioning (First Fit , Best Fit, Worst Fit) - Code


Credits

print('Deekshant Wadhwa')

The programs in this repo are for educational πŸ“š purpose. They are free to be used in any of your projects πŸ’² or experiment files πŸ“. Do concider not copying Β© this content onto your own repo/website without proper acknowledgements πŸ‘½.

Drop a start ⭐ maybe your wish will come true β˜•