"In computer science, stack is defined as an abstract data type that serves as a collection of elements, with two main principle operations. These main principle operations are Push and Pop. Push is defined as the one that adds an element to the collection and pop is that which removes the most recently added element that was not yet removed. Stacks are used to implement functions, parsers, expression evaluation and backtracking algorithms. There are hardware stacks and software stacks. Both these stacks are used to support four major computing areas in computing requirements. The four major computing areas where stacks are been used are expression evaluation, subroutine return address storage, dynamically allocated local variable storage and subroutine parameter passing. A stack works on the principle of last in first out (LIFO), as removing a plate other than the top one on the stack is not very easy without first removing those plates above it in the stack. The presentation give better understanding on the topic. "

Helan Mariam Aipe

14 resources

0

0

0

Like