Operating System

Implementation in C 
  1. Implementing FCFS - Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  2. Implementing Non Preemptive SJF - Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  3. Implementing Preemptive SJF - Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  4. Implementing Non Preemptive Priority Scheduling - Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  5. Implementing Preemptive Priority Scheduling - Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  6. Implementing Round Robin Scheduling Algorithm- Drawing Gantt Chart and calculating Average Waiting Time and Average Turn Around Time
  7. Best Fit Algorithm : AppPerfect
     
Implementation in Java
  1. Ganttchart for FCFS and SJF.
  2. Banker's Algorithm for Deadlock Avoidance 
  3. Gantt Chart for Preemptive and Non-Preemptive Priority Scheduling
  4. Gantt Chart for Round Robin Scheduling  
  5. Implementing Producer Consumer problem using Busy Waiting

No comments:

Post a Comment