=====data Keyword 2=====
queue overrun condition

====Definition====
**Queue Overrun/Overflow Condition** happens when a program attempts to add an element onto an already filled queue.
====References====

  * http://wiki.answers.com/Q/Overflow_and_underflow_conditions_in_data_structures
  * http://gstreamer.freedesktop.org/data/doc/gstreamer/head/gstreamer-plugins/html/gstreamer-plugins-queue.html

=====data Keyword 2 Phase 2=====
stack (LIFO or FIFO?)

====Definition====

LIFO is an acronym that stands for "Last In, First Out."  When it comes to stacks, functions and procedures that are running become stacked on top of one another in memory (called a "push").  When an item is removed from the stack (or "popped"), it is removed from the top down.  This computing action allows for stack integrity, and limits access/insertion.  

FIFO means "First In, First Out."  In this regard, data and processing are handled on a first come, first serve basis through usage of a queue (or linear data structure).  The first process in line is handled before any others are, and then the next, and so on.  
====References====
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

  * "LIFO(computing)"  http://en.wikipedia.org/wiki/LIFO_%28computing%29
  * "FIFO"  http://en.wikipedia.org/wiki/FIFO
  * "Stacks and Queues"  http://introcs.cs.princeton.edu/java/43stack/

====Demonstration====

  * To put another node on top of the stack, you "push" the node onto the top of the stack and becomes the top of the stack (obviously).
  * To pull nodes from the top of the stack, you "pop" the top node off of the stack.

LIFO STACK (Last In, First Out)

(The number represents the order in which they were put into the list)

  ( 6 ) TOP (This would be the first one out, being the last one input, because it is on the top of the list)
    ^
    |
  ( 5 ) 
    ^
    |
  ( 4 
    ^
    |
  ( 3 )
    ^
    | 
  ( 2 )
    ^
    |
  ( 1 ) BOTTOM (This would be the last one out, although it was the first one input)

FIFO STACK (First In, First Out)

(The number, just like above, represents the order)

  ( 1 ) TOP (This would be the first one out)
    ^
    |
  ( 2 ) 
    ^
    |
  ( 3 )
    ^
    |
  ( 4 )
    ^
    |
  ( 5 )
    ^
    |
  ( 6 ) BOTTOM (This would be the last one out)