Instruction 3

FIFO and LIFO queues

The FIFO queue (First In First Out) is a data structure which is used to store data. When a new element is inserted, it is always added to the end of the queue. When an element has to be read, always the first one in the queue is returned (and deleted), so the FIFO queue may be used to process data in the order of its insertion.

The LIFO queue (Last In Last Out) is a data structure similar to FIFO, but always the last one element is returned.

Tasks:

1. Implement the FIFO queue which stores name and surname of a student. Then simulate servicing them by the dean's office.

2. Implement the LIFO queue which stores also student and simulates dean's office. Compare the results with results from Task 1.