Assignment -

This assignment has two primary goals. The first goal is to give students an opportunity to study an implementation of the adaptable heap priority queue. Students are expected to acquire a deeper understanding of the implementation through this assignment.

The second goal is to give students an opportunity to implement an application that uses a priority queue. The application to be implemented is a simulation of a process scheduler of a computer system. Though the simulated scheduler is a small, simplified version, it reflects some of the basic operations of a typical process scheduler.

Implement this program as ProcessScheduling.java. You may have multiple classes and multiple files but your main method must be in the ProcessScheduling.java file.

No separate documentation is needed. However, you must include a brief description of the data structure D at the beginning of your source code as comments. You must also include the specification of each method in your program and you must include sufficient inline comments within your program.

Attachment:- Assignment Files.rar