5.1.6+Describe+the+characteristics+and+applications+of+a+stack

A stack is a particular kind of abstract data type in which collections are modified using the addition of an entity to the collection, known as push and removal of an entity, known as pop. The relation between the push and pop operations is such that the stack is a Last In First Out data structure. In a LIFO data structure, the last element added to the structure must be the first one to be removed. This is equivalent to the requirement that, considered as a linear data structure, or more abstractly a sequential collection, the push and pop operations occur only at one end of the structure, referred to as the top of the stack. Often a peek or top operation is also implemented, returning the value of the top element without removing it.



Internet Distraction Stack
Loading up a series of webpages as a distraction from the work you should be doing and working back from the last page opened until you arrive back at the work.

Programs running Subroutines
A program will run subroutines by first pushing the current state of the program to a stack rss url="https://groups.diigo.com/group/comp_sci/rss/tag/5.1.6" link="true" number="5"