Data Structures

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.

The slides for basic overview and algorithm analysis at Feb 26 and 27.

This slides for linear list including sequence list and queue list, this slides for linked list. The textbook problems code 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10. A online C language demonstrates platform.

This slides for stack and queue on March 6, 12 and 13.

The slides for string, array and generalized list on March 19, 20, 26 and 27. With code for string structures and matrix, and also about problem page 109.

Based on the linear data structure experiment at april 1, the operation problem should be completed during class time and be submitted in the nearest class. The experiment report format must like that.

The slides for tree structures, array and generalized list on April 2, 3, 9, 10 and 16, including non-recursive binary tree. Practices

Based on the stark and queue data structure experiment on april 8, the operation problem using C language should be completed during class time and also be submitted in the nearest class.

Based on the binary tree data structure experiment on april 15, the operation problem using C or CPP language should be completed during class time and also be submitted in the nearest class.

The slides show the diagram part on April 16 and 17 class.

Based on the Huffman tree data structure and Huffman encode experiment on april 21, the operation problem using C or CPP language should be completed during class time and also be submitted in the nearest class.

The slides shows the searching part on April 23 and 24 class.

Experiment 5 and experiment 6 on the basic graph on April 27 and 28, respectively.

The slides shows the sorting part on Mar 7 and 8 class.