Operating Systems Concepts Project List
Operating Systems Concepts Project List
Guidelines:
1) The simulator (graphical animation) must be web based/online.
2) Text-based simulation will not be accepted.
3) No restriction on programming language
4) Deadline for delivery will be after the final exam.
5) Each group would submit the Code, Tutorial document, and a Readme file.
6) The above files must be available in online web interface also.
7) The project will be tested/deployed on a desktop/laptop system available in my office.
8) Marking Rubrics are given in Appendix – A
9) Within the group each student will be marked individually based on viva and his efforts.
10) There will be only demonstrations at the time of submission (No Presentation)
11) Select your topic and get approved by the course instructor.
12) Marks will be awarded on the scale of the following criteria.
o Outstanding 20 – 15
o Best 14 – 10
o Average 05 – 09
o Poor 00 – 04
List of Projects
Topic 1: SIMULATION: CPU SCHEDULING ALGORITHMS COMPARISON
1) First Come First Serve (FCFS).
2) Shortest Job First (SJF)
3) Longest Job First (LJF)
Topic 2: SIMULATION: CPU SCHEDULING ALGORITHMS COMPARISON
1) Priority Scheduling.
2) Round Robin.
3) Selfish Round Robin
Topic 3: SIMULATION: CPU SCHEDULING ALGORITHMS COMPARISON
1) Shortest Remaining Time First (SRTF)
2) Longest Remaining Time First (LRTF)
3) Highest Response Ratio Next (HRRN)
Topic 4: SIMULATION: Disk Scheduling Algorithms COMPARISON
1. FCFS (First Come First Serve)
2. SSTF (Shortest Seek Time First)
3. SCAN (Elevator Algorithm)
4. C-SCAN (Circular SCAN)
Topic 5: SIMULATION: Disk Scheduling Algorithms COMPARISON
1) LOOK
2) C-LOOK
3) LIFO (Last-In First-Out)
Topic 6: SIMULATION: Disk Scheduling Algorithms COMPARISON
1) N-Step SCAN
2) F-SCAN
3) RSS
Topic 7: SIMULATION: MEMORY ALLOCATION METHODS COMPARISON
1) Fixed partition with equal size
2) Fixed partition with unequal size
Topic 8: SIMULATION: MEMORY ALLOCATION METHODS COMPARISON
1) Dynamic partition with first fit
2) Dynamic partition with best fit
3) Dynamic partition with worst fit (next fit)
Topic 9: SIMULATION: PAGE REPLACEMENT POLICIES COMPARISON
1) FIFO Page Replacement Algorithm
2) LIFO Page Replacement Algorithm
3) LRU Page Replacement Algorithm
Topic 10: SIMULATION: PAGE REPLACEMENT POLICIES COMPARISON
1) MRU Page Replacement Algorithm
2) Optimal Page Replacement Algorithm
3) Random Page Replacement Algorithm
Topic 11: SIMULATION: Deadlock Avoidance algorithm
1) Banker's Algorithm Simulator
2) Resource allocation Graph