Before you move onto programming, which I commend, try using the Check Spelling feature first!
2007-01-17 06:01:32
·
answer #1
·
answered by Not so looney afterall 5
·
0⤊
1⤋
It refers to programming that uses data structures. The simplest data structure could be an array. More complicated structures include queues, lists and stacks. Queues are useful for first in, first out operations (like a line of people moving). Stacks are useful for first in, last out operations (like a stack of papers on a desk). Using data structures has advantages because when you become familiar with them, there is always an appropriate one to use for a given situation, and their behavior can be understood better.
This is not a beginner's topic, I recommend learning the syntax of a language and structure of a program first.
2007-01-17 14:18:50
·
answer #2
·
answered by Pfo 7
·
0⤊
0⤋
Data structures are types of containers for holding information. A basic example is an array variable. It holds information in a very crude form. As you go up there are Stack (First in, Last out), Queues (First in, First out), Deques (Double sided Queue).
Then there are more advanced like Trees. There are binary trees (trees where each node divides into two branches), Heaps (Tree where the indexes as you get closer to the root are always larger than the branchs) and there is many more. I would take computer science at college if you are interested in this stuff.
2007-01-17 18:47:31
·
answer #3
·
answered by The Master 5
·
0⤊
0⤋