Apply theoretical concepts of trees, heaps and queues.
Create a priority queue to handle a series of jobs that will be given to you.
Each job will have an ID, a priority, and a duration that reflects the length of cycles that the job will take. Your task is to create a heap that you keep sorted so that the highest priority with the shortest execution time job is always ready. You will then create a “machine” with 4 processors.
Each processor can handle one job at the time, so you will send the first 4 jobs to each processor then count down each job one cycle at a time until a job completes. When it does, you will need to clear that job (remove it from the heap) then find the next job to be executed.
You will show your output one cycle at a time for each processor (displaying the job ID and the
number of cycles left in that job (see output below)).
The program must read in a file called “[login to view URL]” that contains the job information. I am providing a sample file to test with.
Processor: 1 2 3 4
2:5 9:15 1:10 10:7 2:4 9:14 1:9 10:6 2:3 9:13 1:8 10:5
(This is in the text file, See Attached txt File)
Data sets can be used are:
1 2 10
2 1 5
3 5 7
4 9 4
5 4 1
6 4 1
7 4 1
8 10 5
9 1 15
10 3 7
Hi, I have over 10 years of experience in C/C++ programming. I have implemented a priority queue with heap before. I can finish this assignment quickly. Please message me and we can get started.
20 freelancers are bidding on average $41 for this job
Hello,I will do simplest coding in C++,C using OOP,data structures [login to view URL] it is an assignment then coding will be easily understandable for u.I have done many C++ works [login to view URL] have a chat . Thanks.
Hi, I am a competitive programmer and software engineer. I am an expert in data structures and algorithms. I have solved this types of problem before. I am interested to do the job.