2026 Data Structures (Spring)
Undergraduate course, Guangdong University of Petrochemical Technology, Computer Department, 2026
The data structure is a data organization and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data. There are useful textbook after class, such as the algorithm 4th.
The answers of textbook: Chapter 1, Chapter 2, Chapter 3, Chapter 4, Chapter 5, Chapter 6, Chapter 7, Chapter 8
The experiment must follow the format and submit in .pdf files, experiment task 1, experiment task 2, experiment task 3, experiment task 4, experiment task 5.
| Chapter | Date/Slides | Tasks | Description |
|---|---|---|---|
| introduction | 0302 | exercise1 | algorithm and complexity, data structure |
| linear | 0310 | homework1, exercise2, exercise1_answer | linear table |
| stack | 0319-26 | homework2,exercise3 | stack code 1, traverse, hanoi, queue, queue chain,bracketsP,danceP,expressionP |
| string, group | 0331-0407 | homework3, exercise4 | String match algorithm 1, 2, 3 |
| Tree, binary tree | 0409 | homework4, exercise5 | centre order recursive, centre order non-recursive, pre-order, copy binary tree, tree depth, count tree node, in order traversal, in order traversal head node, thread tree, huffman tree, huffman code, example |
| Diagram | 0421 | exercise6, homework5 | Adjacency matrix, adjacency table, DFS recursive, DFS non-recursive, DFS adj-matrix, DFS adj-table, BFS, prim’s algorithm, kruskal’s algorithm, dijkskra’s algorithm, fluoride algorithm, topology sorting, critical path |
| Search | 0430 | exercise7, homework6 | binary search tree, B tree, Hash table |
| Sorting | 0511 | exercise8 | ———– |
综合实训时间：2026年6月22日-26日 上午1-4节
地点：学科楼409 综合实验(三)室
完成条件：综合实验内容