What logic do stacks follow?

Stacks operate on the principle of "last-in, first-out" (LIFO). This means that the last item added to the stack is the first one to be removed. You can visualize a stack like a tower of plates: when you add a plate (push), it goes on top and when you remove a plate (pop), you take the one that is on top first. This behavior is crucial for various programming tasks, including function call management and undo mechanisms in applications.

In contrast, the other options describe different data structures. "First-in, last-out" refers to the opposite behavior and doesn't accurately describe stacks. "Random access" applies to arrays or other structures that allow for direct access to any element without regard to order. "First-in, first-out" corresponds to queues, where the first element added is the first one to be removed. Understanding LIFO is vital for effectively using stacks in programming and software development tasks.