I'm studying for an exam in Data Structures and Algorithms and while looking through past exam papers this question came up.
"Describe a situation within a computer system in which a Queue data structure
forms a natural component of any implementation."
Any chance of getting a hand with this? Be greatly appreciated :(happy):
Need more info. Do you not know the answer, or do you not understand the question? (I'm not sure I understand the question...)
Printerjobs; anything where not waiting in line is frowned upon.
Originally Posted by Ryanmc56
As Josah mentioned, the printer queue is a very good example. In general, the queue is a natural fit for any any application or process that has a FIFO (First In First Out) nature. With respect to the computer it self, applications can include CPU scheduling, thread processing according to a FIFO priority, and of course the print queue. With respect to software applications, a phone answering system or customer inquiry response system might be implemented using a queue data structure.
Hope this helps,
Thanks a million for the help. It was just very confusing how the question was presented.