CLASS NOTES FOR 9/10/02
Data Structures = Structure of Data
Queue (Q) = First choice is first (First come first serve)
Stack = Last one first
Algorithm = A way to solve a problem by programming.

- Array is one of the most important Data  Structures
- Array is used to BUILD (For example, A pperson can build a Stack, Queue, Tree, or a Graph (also known as Network)

1)      Name one application for each of Data Structure.
Graph is used for Networking
Stack is used in cascading of windows
Queue is use for Printers, memory and voicemail
?
2)    Conversion of Infix to Postfix
Postfix = 2, 3 +
Prefix = +2
            
            Old Calculator were either postfix or prefix but not infix
            Postfix and Prefix doesnĄ¯t need prantheses when programming
            APL reads from Right to Left
            One of the problem of Data Structure is conversion of Infix to Postfix
            Opreators are + * - /
?
3)      How do you evaluate Postfix Notation?
In Postfix order is not important
            When there is a number push, when a operator pop (pop and push belongs to Stack)