Chapter 7QueuesCopyright © 2005 Pearson Addison-Wesley. All rights reserved.7-2Chapter ObjectivesExamine queue processingDefine a queue abstract data typeDemonstrate how a queue can be used to solve problemsExamine various queue implementationsCompare queue implementationsCopyright © 2005 Pearson Addison-Wesley. All rights reserved.7-3QueuesA queue is a collection whose elements are added on one end and removed from anotherTherefore a queue is processed in a FIFO fashion: first in, first outElements are removed in the same order they arriveAny waiting line is a queue:the check out line at a grocery storethe cars at a stop lightan assembly lineCopyright © 2005 Pearson Addison-Wesley. All rights reserved.7-4QueuesA queue is usually depicted horizontallyOne end of the queue is the rear (or tail), where elements are addedThe other end is the front (or head), from which elements are removedUnlike a stack, which operates on one end of the collection, a queue operates on both endsCopyright © 2005 Pearson Addison-Wesley. All rights reserved.7-5FIGURE 7.1 A conceptual view of a queueCopyright ©...