Task scheduling systems play an important role in managing processes in an efficient way. They assess the time duration taken up by a particular process, and accordingly allot the processes slots so that they can complete their execution. Managing tasks in this way allows efficient use of the system resources and allows faster and optimized performance. Using similar techniques, tasks (other than system processes) can also be managed efficiently by filtering them using ‘time/duration’ as a primary component. The System proposed in this paper aims at creating a system which helps to manage Conferences into three slots viz. Shortest Conferences first, Longest Conferences First, & First Come First Serve, which would be done by obtaining Conference details from the user. Details would include title of the Conference and its duration. The slots will then be filled depending on duration of a particular conference.

First Come First Servce Approach Insertion Sort Data Structures