Queue Data Structure Examples Hospital Management

Give me Queue Data Structure examples and detail.

[Pathak]

Following is information about Queue Data Structure:

The Queue, Stack, and Dequeue Interfaces the Queue interface represents a collection of elements to which we can add elements and remove the next element.

More precisely, the operations supported by the Queue interface are:

add(x): add the value x to the Queue
remove(): remove the next (previously added) value, y, from the Queue and return Notice that the remove() operation takes no argument. The Queue’s queueing discipline decides which element should be removed. There are many possible queueing disciplines, the most common of which include FIFO, priority, and LIFO.

A FIFO (first-in-first-out) Queue, illustrated in Figure 1.1, removes items in the same order they were added, much in the same way a queue (or line-up) works when checking out at a cash register in a grocery store. This is the most common kind of Queue so the qualifier FIFO is often omitted. In other texts, the add(x) and remove() operations on a FIFO Queue are often called enqueue(x) and dequeue(), respectively.

For more information you are free to download attached pdf file.