Write a simulator in C language and run on a Unix machine for a short term scheduler using preemptive round robin scheduling. Processes will wait on the ready queue until they are dispatched. If a running process is preempted (meaning its CPU burst time was longer than the quantum), it moves to the end of the ready queue. Non preempted processes move to an I/O queue after completing their CPU burst. After reaching the head of the I/O queue, the process is serviced by the I/O device and placed back in the ready queue. Each process continues in this manner until a specified number of milliseconds of processor time are complete (the process duration time). This implies that in addition to writing the scheduling software, you will need a queue abstract data type. The abstract data type must follow the queue interface specification. Code for the queue data types in C and C++ is available on the specification page if you prefer not to code these for yourself. As this program should have multiple files (i.e. the queue abstract data type and your simulator at a minimum), you are strongly encouraged to learn how to use a makefile
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.
## Deadline information
Deadline to complete is saturday,17 2001. The project should be written in C and run on UNix. Please follow the detail requirements on text.zip. Looking for coders who can follow the exact requirements come in the zipfiles that i attacched below.