fundamental computer science related concepts and further reading Queues -  queue is a data structure that provides access to its elements on “first-in, first-out” basis —http://www.cs.grinnell.edu/~walker/courses/195.fa01/lab.queues.html Stacks - are an abstract data type and data structure based on the principle of Last In First Out (LIFO). http://en.wikipedia.org/wiki/Stack\_(data\_structure) Trees - is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. It is an acyclic connected graph where each node has a set of zero or more children nodes, and at most one parent node. http://en.wikipedia.org/wiki/Tree\_(data\_structure) Linked Lists - is data structure that consists of a sequence of data records such that in each record there is a field that contains a reference ( 12.->99.->37.->X ) http://en.wikipedia.org/wiki/Linked\_list Pointers - a pointer (reference) is a value that enables a program to directly access the particular data item, such as a variable or a record, in the computer’s memory or in some other storage device. Request headers - The information, in the form of a text record, that a users browser sends to a Web server containing the details of what the browser wants and will accept back from the server. The request header also contains the type, version and capabilities of the browser that is making the request so that server returns compatible data. Upon receipt of the request header, the server will return an HTTP response header to the client that is attached to the file(s) being sent.
4/20/2009 ~ 2 min read
