Stack: Difference between revisions

Revision as of 14:08, 5 December 2016

Programming basics^[1]

In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed. The order in which elements come off a stack gives rise to its alternative name, LIFO (for last in, first out). Additionally, a peek operation may give access to the top without modifying the stack.

The name "stack" for this type of structure comes from the analogy to a set of physical items stacked on top of each other, which makes it easy to take an item off the top of the stack, while getting to an item deeper in the stack may require taking off multiple other items first^[2].

^[3]

Access methods of stack[edit]

push
pop
isEmpty

stack[edit]

This video discusses the C programming language, but the content is clear to describe stack.

Standards[edit]

Describe the characteristics and applications of a stack.

Construct algorithms using the access methods of a stack.

External Links[edit]

References[edit]

↑ http://www.flaticon.com/
↑ https://en.wikipedia.org/wiki/Stack_(abstract_data_type)
↑ By Maxtremus - Own work, CC0, https://commons.wikimedia.org/w/index.php?curid=44458752

[1] ttp://www.flaticon.com/

[2] ttps://en.wikipedia.org/wiki/Stack_(abstract_data_type)

[3] By Maxtremus - Own work, CC0, https://commons.wikimedia.org/w/index.php?curid=44458752

[1]

[2]

[3]

@@ Line 7: / Line 7: @@
 [[File:Lifo stack.png]]<ref>By Maxtremus - Own work, CC0, https://commons.wikimedia.org/w/index.php?curid=44458752</ref>
-Characteristics:
-•
-Last in, first out (LIFO).
-Examples of the applications of stacks may include running recursive processes, return memory addresses
-Access methods:
-•	 push
+== Access methods of stack ==
-•	 pop
+* push
-•	 isEmpty.
+* pop
+* isEmpty