Identify and describe each operation(s) in a Stack and a Queue.

A Stack and a Queue are both abstract data types that are commonly used in computer science. They each have unique operations that define their functionality.

1. Stack:

   • Push: This operation adds an element to the collection. The element is placed on top of all other elements.
   • Pop: This operation removes the most recently added element that was not yet removed.
   • Peek/Top: This operation returns the value of the most recently added element without removing it.
   • isEmpty: This operation checks if the stack is empty.
   • Size: This operation returns the number of elements in the stack.

2. Queue:

   • Enqueue: This operation adds an element to the end of the queue.
   • Dequeue: This operation removes an element from the front of the queue. The element that is removed is always the first one that was added.
   • Front: This operation returns the first element of the queue.
   • Rear: This operation returns the last element of the queue.
   • isEmpty: This operation checks if the queue is empty.
   • Size: This operation returns the number of elements in the queue.

In summary, a Stack is a LIFO (Last In First Out) data structure, meaning the last element added is the first one to be removed. A Queue is a FIFO (First In First Out) data structure, meaning the first element added is the first one to be removed.