Chapter 7
Queues
Chapter 7 discusses about queues and its variants such as circular queues and doubly ended queues. The static, dynamic representation and operations of all the types of queues are explained and exemplified. Various applications of the queues are listed, and one of the applications called Simulation of Time-Sharing System is explained in detail.
7.1 INTRODUCTION
Queue is a linear data structure in which insertions are made at one end called rear, and deletions are made at the other end called front. A queue is also known as a structure that models the first-come first-serve order or equivalently the first-in first-out (FIFO) order. That is, the element that is inserted first into the queue will be the element to be deleted first, ...
Get Data Structures and Algorithms Using C++ now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
