avinash1tiwari / os-project

The Scheduling problem is solved by Round Robin algorithm.

OS Project of Round Robin algorithm

Problem Statement:

" Sudesh Sharma is a Linux expert who wants to have an online system where he can
handle student queries. Since there can be multiple requests at any time he wishes to dedicate
a fixed amount of time to every request so that everyone gets a fair share of his time. He will
log into the system from 10am to 12am only. He wants to have separate requests queues for
students and faculty. Implement a strategy for the same. The summary at the end of the
session should include the total time he spent on handling queries and average query time. "

The given problem is scheduling problem. The problem can be solved by Round Robin algorithm.

Program execution sequence:

1. Taking inputs of queries from user
2. Sorting all queries according to ArrivalTime
3. Merging all queries (initial priority to Faculty's query)
4. Applying RoundRobin algorithm on merged queries
5. Print the result

Follow these instructions while executing the program:

1. Enter number of queries between 0 & 120
2. Make sure to keep value of TimeQuantum minimum
3. Enter Query Arrival Time in the format of HHMM
    Example: 10:25 should be entered as 1025
4. Next Query's ArrivalTime must be less than previous Query's CompletionTime (ArrivalTime + BurstTime)
5. BurstTime must be entered such that (ArrivalTime + BurstTime) < 120