Suchergebnisse für 《数据结构教程...
Beispielbild für diese ISBN
Colleges computer class 12th Five-Year Plan materials: data structure the tutorial exercises parsing and algorithms on the machine to achieve(Chinese Edition)
ISBN 10: 7560629253
ISBN 13: 9787560629254
Neu
paperback
Anbieter: liu xing, Nanjing, JS, China
Verkäuferbewertung 5 von 5 Sternen
paperback. Zustand: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pub Date: 2012 09 Pages: 287 Publisher: Xi'an Electronic Science and Technology University Press' Higher Education computer class 12th Five-Year Plan textbook: data structure the tutorial exercises parsing and algorithms. machine implementation of Hu Yuanyi written data structure tutorial (Xi'an University of Electronic Science and Technology Press. August 2012). supporting the use of teaching aids. improve and supplement the contents of the data structure. from a practical point of view. Data structure tutorial exercises. the book is easy parsing algorithm and some exercises algorithm debugging data structure tutorial to achieve a nearly 80-on program and covers all the contents of the data structure. depth grasp and flexibility in the use of the data structure knowledge. expand thinking and methods of problem-solving and programming as well as improve the practical ability of great help. Data structure the tutorial exercises parsing and algorithms on the machine to achieve a data structure algorithms can be used with various types of data structures (C language) teaching materials to use. play a role in convergence of teaching and practice. In addition. the book also Kaoyan information as well as practical information in computer applications and reference books. Contents: Chapter 5. Chapter 2 of the first problem parsing Chapter 1 Introduction Problem parsing the linearization table exercises parse Chapter 3 stacks and queues exercises parse Chapter 4 string Exercise parsing the array and generalized table exercises parse Chapter 6 tree binary tree Chapter 7 of the exercises parsing Figure Chapter 8 of the exercises parse Find exercises to parse Chapter 9 Sort Problem parsing the second algorithm linear list algorithm of Chapter 10 on the machine to achieve the 10.1 sequence table on the machine to achieve basic operations 10.2 insert in the header to generate a single linked list generate a single linked list insert tail 10.3 10.4 single linked list of basic arithmetic 10.5 doubly linked list basic operations 10.6 10.7 cases static list. 2.1 algorithm algorithm 2.2. 10.8 cases to 10.9 cases 2.3 algorithm 10.10 cases 2.4 algorithm achieve 10.11 cases 2.5 algorithm Chapter 11 stack stack and queue algorithm on the order of the stack machine to achieve 11.1 11.2 chain of basic operations basic operations 11.3 cycle queue basic operations 11.4 chain queue basic operations of 11.5 cases 3.1 algorithm algorithm 3.5. 11.6 cases of Chapter 12 string algorithm machine implementation order of 12.1 string basic operations 12.2 generated Strand demand and the string length. the string concatenation operator the 12.3 chain string Qiuzi string insertion operator op 12.4 Strand string the 12.5 string simple pattern matching machine to achieve 12.6 strings without backtracking KMP matching Chapter 13 array with generalized table algorithm Quick transpose 13.3 sparse matrix cross linked list storage 13.4 13.1 Matrix transpose 13.2 matrix generated generalized machine table and seek a generalized table Chapter 14 of the length and depth of the operator tree and binary tree algorithm to achieve the the 14.1 binary tree traversal 14.2 binary tree non-recursive traversal 14.3 another order non-recursive binary tree traversal 14.4 hierarchical binary tree traversal 14.5 to recovery application binary tree 14.6 binary tree traversal 14.7 binary tree traversal sequence in order threaded binary 14.8 Huffman tree and Huffman coding 14.9 cases 6.4 algorithm first 15 Chapter graph algorithms. machine 15.1 establish connectivity undirected adjacency matrix 15.2 Figure depth-first search breadth-first search 15.4 Figure 15.3 Figure 15.5 depth-first spanning tree Prim algorithm 15.8 15.6 breadth-first spanning tree 15.7 minimum spanning tree Kruskal minimum spanning tree algorithm the 15.9 single source shortest path algorithm Dijkstra 15.10 each pair. Bestandsnummer des Verkäufers NE042163