Real life examples of queue are: 1. A queue of people at ticket-window: The person who comes first gets the ticket first. The person who is coming last is getting the tickets in last. Therefore, it follows first-in-first-out (FIFO) strategy of queue.
2. Vehicles on toll-tax bridge: The vehicle that comes first to the toll tax booth leaves the booth first. The vehicle that comes last leaves last. Therefore, it follows first-in-first-out (FIFO) strategy of queue.
3. Phone answering system: The person who calls first gets a response first from the phone answering system. The person who calls last gets the response last. Therefore, it follows first-in-first-out (FIFO) strategy of queue.
4. Luggage checking machine: Luggage checking machine checks the luggage first that comes first. Therefore, it follows FIFO principle of queue.
5. Patients waiting outside the doctor's clinic: The patient who comes first visits the doctor first, and the patient who comes last visits the doctor last. Therefore, it follows the first-in-first-out (FIFO) strategy of queue.
Stack is a linear data structure in which item insertion or deletion takes place at only one place called TOP.
Stack is also called as LIFO or restricted list. What is LIFO ?
LIFO - Last In First Out
It is the principle which specifies that the data item that is inserted last into the stack is the first one to be deleted from the stack.
Stacks in data structures
We can relate stacks to some real life objects and situations, as you can see in the picture of stack of books,
One can add a new book to an existing stack of books only at its top and no where else. Similarly a book cannot be added in the middle of the stack so one has to remove all the books above to add a new book at desired place.
For more information and programs on stacks and explanation visit Program2Do