A data structure is the order in which data is stored. For example, in a database with names and addresses, you could decide to store name and address together in each record. That would be your data structure. Or you could decide to save all the names in one list, all the addresses in another list, all the zips in a third, etc. That would be a different data structure. With the first structure, you would retrieve the data for the third record by simple reading the third record. With the second data structure you would have to read the third item of each list. So your "data structure" will determine how that program is written to interact with the data.
2007-04-03 00:38:04
·
answer #1
·
answered by dewcoons 7
·
0⤊
0⤋
A data structure can be an array, a table, many things. It is any structure designed to hold data.
2007-04-03 07:39:59
·
answer #2
·
answered by Kokopelli 6
·
0⤊
0⤋
data structures are classified into two categories linear and nonlinear. a data structure is said to be linear if its elements form a sequence. Elements in a non linear data structure do not form a sequence . Array is one data structure that has been used more than any other.
2007-04-03 07:43:55
·
answer #3
·
answered by Anonymous
·
0⤊
0⤋
- A specific data object used as an object of computation.
- A logical relationship among data elements that is designed to support specific data manipulation functions
- An organised aggregate of data items.
- The form various pieces of data take in relation to each other, like a data tree.
2007-04-03 14:03:02
·
answer #4
·
answered by Smutty 6
·
0⤊
0⤋