《数据结构》实践环节考核指导2356（Data structure practice session assessment guide 2356）.doc

《数据结构》实践环节考核指导2356（Data structure practice session assessment guide 2356） 2, must build a new country strategy, strive to read a good book -- Guo Moruo Data structure practical link assessment guidance Type Course experiment evaluation Two, purpose and requirements The purpose and task of this course is to make students master the data structures of various common and typical algorithms to provide the necessary basis for the follow-up study of computer courses, improve the ability of learners to use data structures to solve practical problems This assessment mainly achieves two purposes: 1. checking students logical structure, storage structure and understanding of algorithms 2. check students choice of data structure and application of algorithm design and Implementation Three, assessment environment Software requirements: MS-DOS mode for DOS operating system or Windows environment; Turbo C 3 system Four, assessment content 1, linear table insertion and deletion The operation of inserting and deleting ordered sequential tables requires that the data field be integer The operation of inserting and deleting ordered single linked lists requires that the data field of a single table is a string, but repeated strings are not allowed to be inserted into the table Delete operation is based on the input string, first find the corresponding results, delete it 2, stack and queue operations For some simple applications, such as hexadecimal conversion, string input, etc., the use of stack or queue to achieve 3, two fork tree operation Requires the use of two fork chain as storage structure, complete the establishment of two fork tree, first order, sequence and after order, and by level traversal and seek all the leaves and nodes of the number of operations 4, graph traversal operations Adjacency matrix or adjacency table can be used as storage structure to complete the DFS and BFS operations of directed graphs and undirected graphs 5, data search To realize sequential search,