Read file “process.txt”. File contains data of the format
Process_Name Priority_Level Entry_Time
P1 2 13.43.41
Build a doubly linked list to implement priority Queue. The priority of the process will be according to given priority_level but if two processes with the same priority_level exist in the queue then the process with least entry time will exit first.
User should be given choice to whether enter a new process into the queue or dequeue existing process.
You may use structure “struct time” for getting system time.
Dear Mubashar, Questions in this section are answered for free. We
can't fulfill them all and there is no guarantee of answering certain
question but we are doing our best. And if answer is published it
means it was attentively checked by experts. You can try it yourself
by publishing your question. Although if you have serious assignment
that requires large amount of work and hence cannot be done for free
you can submit it as assignment and our experts will surely assist you
Mubashar
14.04.19, 11:03
show answer of this question
Leave a comment
Thank you! Your comments have been successfully added. However, they need to be checked by the moderator before being published.
Comments
Dear Mubashar, Questions in this section are answered for free. We can't fulfill them all and there is no guarantee of answering certain question but we are doing our best. And if answer is published it means it was attentively checked by experts. You can try it yourself by publishing your question. Although if you have serious assignment that requires large amount of work and hence cannot be done for free you can submit it as assignment and our experts will surely assist you
show answer of this question
Leave a comment