Seller: liu xing, Nanjing, JS, China
paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: 2013 Pages: 250 in Publisher: People's Posts and Telecommunications Publishing House in the 21st century higher education computer planning materials National bilingual teaching demonstration programs supporting materials: data structures and algorithms is a national bilingual education model curriculum data The structure supporting materials prepared. according to the Journal of Computer Science and Technology. Ministry of Education of Computer Science and Technology Teaching Steering Committee to develop professional development strategy research report and Professional norms. The book is the logical structure of each chapter are data storage structure and the corresponding algorithm to achieve the main line. and to analyze the operation efficiency of the algorithm. The book is divided into eight chapters. covers a variety of common data structures. Data structures and algorithms of Chapter 1 introduces the basic concepts of analysis. 2 to 6 describes the typical linear structure. the structure of the tree structure and Figure Chapter 7-8 Introduction Find and sort operations. In addition. each chapter with exercises and hands-on experiment content. the computer experiment provide complete. you can run the program on the computer experiment for the reader is referred to. in order to enhance the reader's understanding of the knowledge and application. Higher Education in the 21st century computer planning materials national bilingual education model curriculum supporting materials: data structures and algorithms teaching book both as institutions of higher learning computers and related data structures courses as engaged in Computer Engineering and Applications The readers of the reference books. Contents: Chapter 1 Introduction 1.1 data and its logical structure 1.1.1 1.1.2 logical structure of the basic concepts 1.2 Data structure 1.2.1 What is the tuple data structure of the data structure 1.2.2 Description 1.2.3 data structures and data types 1.3 Storage 1.3.1 sequential storage structure 1.3.2 linked storage structure and operations to achieve storage structure 1.3.5 1.3.3 1.3.4 hash index storage structure computing 1.3.6 1.4 algorithm described further discussion and analysis of algorithms 1.4. What is algorithm algorithm 1.4.2 Description 1.4.3 algorithm analysis 1.5 network Jiaofu resources 1.6 Summary Practice I. Chapter 2 Linear Table 2.1. the basic concepts of linear form in the order of 2.2 linear table and 2.3 linear form 2.4.2 doubly linked list 2.5 link and to achieve 2.3.1 linear chain store principle 2.3.2 linear chain store algorithm 2.3.3 algorithm efficiency analysis 2.4.1 2.4 circular linked list and doubly linked list. circular linked list Application Examples of linear Table 2.5.1 problem proposed algorithm 2.5.2 Analysis 2.5.3 2.5.4 program 2.6 Summary Exercises Chapter 3 stacks and queues 3.1 stack 3.1.1 stack definition 3.1.2 stack of basic computing 3.1.3 stack sequential storage structure 3.1.4 stack chain storage structure application queue queue 3.2.1 3.2 3.1.5 stack defined the 3.2.2 queue basic arithmetic 3.2.3 queue the sequence storage structure 3.2.4 queue chain storage structure the 3.2.5 queue Applications 3.3 Summary Exercises Chapter 4 of string and an array of basic concepts of string 4.1 4.2 strings of basic operations and the storage structure of the string string operation 4.2.1 4.2.2 string of static sequential storage structure 4.2.3 string dynamic sequential storage structure 4.2.4 string the chain storage structure 4.3 array definition and operational the 4.4 array sequential storage structure 4.5 special matrix compression storage 4.5.1 special the matrix 4.5.2 sparse matrix 4.6 Summary Exercises Chapter 5 trees and binary tree 5.1 tree concept and definition of definition 5.1.1 Tree 5.1.2 tree operation 5.2 binary tree nature and storage structure the 5. Seller Inventory # NE047591