I need help with an initial algorithm for this project, or at least where to start with headers and structs, its from a long time ago.

Design and implement a program that simulates some ofthe job scheduling and CPU scheduling of an operating system. Your simulator must conform to the criteria established in these specifications. A detailed design is due on February 4, 2000 in class. The input stream to the program describes a set of arriving jobs and their actions. The following diagram describes Job and process transitions. A graphic view of the simulator a new job Submit Queue process scheduling Complete Queue job scheduling Hold Queue 1 Ready Queue (Run) CPU Hold Queue 2 Long Queue Wait When a job arrives, one of three things may happen: 1. If there is not enough total main memory or total number of devices in the system for the job, the job is rejected never gets to one of the Hold Queues. 2. If there is not enough available main memory or available devices for the job, the job is put in one of the Hold Queues, based on its priority, to wait for enough available main memory (Preallocation) If there is enough main memory and devices for the job, then a process is created for the job, the required main memory and devices are allocated to the process, and the process is put in the Ready Queue