Homework answers / question archive / a) Insertion into a queue that is implemented using and ordinary array with the front of the queue always maintained in component zero of the array

a) Insertion into a queue that is implemented using and ordinary array with the front of the queue always maintained in component zero of the array

Computer Science

Share With

---

a) Insertion into a queue that is implemented using and ordinary array with the front of the queue always maintained in component zero of the array.

b) Deletion from a queue that is implemented using an ordinary component zero of the array.

c) Deletion from a queue using a circular array implementation.

 

 

1. Given the following list of jobs and their associated priority class (the lower the number the higher the priority):

 

?       |  J45  |   J12 |  J17  |  J22  |  J30  |  J56  |  J18  |          ?

(back) |    3   |    4   |    2   |    1   |    3   |    2   |    4   |           (front)

 

           Assuming that no other jobs arrive, list the order in which these jobs would be processed if:

 

a) a priority queue is used.

b) Describe three different schemes by which a priority class might be assigned to a job.

c) Explain what is meant by "starvation"

d) Explain what is meant by "aging"