Data structure
[Users questions | Browse:52 | Favorites]
Users questions:The trouble is, I have a computer examination to the weekend, and now needs an example of data organization, describes its logical structure, storage structure, operation of these three aspects.
Experts answer: cite the example of a data structure, describes its logical structure, storage structure, the three aspects of operation such as a studentTranscripts, records of a class of students in each class results. By the students remember the name of a line into the table. This table is a data structure. Each record (with name, student number, performance, and so the field) is a node, for the entire table, only a start node (no record in front of it) and a finalEnd-point (no record behind it), other nodes will have a only a direct precursor and direct follow-up (in front of and behind it there and only one record). These relations determine the logical structure of this table. So how do we put this table in the data storage to a computer in it? With advancedLanguage to express the relationship between the nodes it? Is a row of memory cells to store the records (such as that used an array) or random data, then each node store a pointer to the link? This is the storage structure of the problem, We are all from the high level language to discuss this issue. (So youQuickly learn C language it). Finally, we have this table (data structure), definitely use it, it is to right this table records query, modify and delete operations on the table which can operate and how to achieve these operations are data operations problem.
Experts answer: cite the example of a data structure, describes its logical structure, storage structure, the three aspects of operation such as a studentTranscripts, records of a class of students in each class results. By the students remember the name of a line into the table. This table is a data structure. Each record (with name, student number, performance, and so the field) is a node, for the entire table, only a start node (no record in front of it) and a finalEnd-point (no record behind it), other nodes will have a only a direct precursor and direct follow-up (in front of and behind it there and only one record). These relations determine the logical structure of this table. So how do we put this table in the data storage to a computer in it? With advancedLanguage to express the relationship between the nodes it? Is a row of memory cells to store the records (such as that used an array) or random data, then each node store a pointer to the link? This is the storage structure of the problem, We are all from the high level language to discuss this issue. (So youQuickly learn C language it). Finally, we have this table (data structure), definitely use it, it is to right this table records query, modify and delete operations on the table which can operate and how to achieve these operations are data operations problem.
- Both passive chip LED and buzzer driver
- Infrared remote control MCU program
- Digital thermometer with a single chip design
- Produced by ALTERA MAX
- Problems at compile time
- SCM: Find the initial value of timer * counter.
- Microcontroller Programming
- Urgent!!! To write a graduation project. Microcontroller-based temperature measurement system design who ah?
- 51 microcontroller instruction MOVA, R0 is a pointer to pass it?
- AD conversion
- This information provided by the users.Thanks!
Computer Knowledge Copyright 2005-2015 All Rights Reserved.