=====data Keyword 2=====
stack push operation

====Definition====
The push operation adds a new element to the top of the stack (FILO)First in Last Out 

====References====
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

 * http://www.cplusplus.com/reference/stl/stack/push/
 
* http://en.wikipedia.org/wiki/Stack_(abstract_data_type)

=====data Keyword 2 Phase 2=====
array vs. linked list (pros/cons)

====Definition====
An array is a simpler, easier format for multiple value storage. You do not need to go threw the list in an array, you can use that element of the array. Linked lists have no benefits.




====Demonstration====
Demonstration of the indicated keyword.

If you wish to aid your definition with a code sample, you can do so by using a wiki **code** block, an example follows:

<code c>
/*
 * Sample code block
 */
#include <stdio.h>

int main()
{
    return(0);
}
</code>

Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:

<cli>
lab46:~$ cd src
lab46:~/src$ gcc -o hello hello.c
lab46:~/src$ ./hello
Hello, World!
lab46:~/src$ 
</cli>