How does a stack differ from a queue?

A stack operates under the Last In, First Out (LIFO) principle, meaning that the last element added to the stack is the first one to be removed. This characteristic makes it analogous to a stack of plates, where you can only take the top plate off.

In contrast, a queue follows the First In, First Out (FIFO) principle, which means that the first element added to the queue is the first one to be removed. This is similar to a line of people waiting to enter a movie theater; the first person in line is the first to enter.

The understanding of these two structures is essential in computer science as they serve different purposes in algorithms and data manipulations. Stacks are commonly used for scenarios like function call management, while queues are often used in processes requiring order, like scheduling tasks.