Describe the stack memory (or data) structure. Give a four-word description of the stack discipline.

What will be an ideal response?

A stack data structure is analogous to a stack of paper, where we assume we
have an inexhaustible supply of clean sheets of paper. In order to place information
on the stack, we write it on a clean piece o paper and put the paper on the stack. To
get information we can only read the top piece of paper. To get information further
down, we must remove some paper. The rule is, if a piece is removed, it is thrown
away. The four word description is last-in-first-out, or LIFO.