Data Structures Algorithms by Deng Jun (6 results)

paperback. Condition: New. Language:Chinese.Paperback. Publisher: China Machine Press. This book fully demonstrates the object-oriented technology in the modern theory of data structures. commonly used.

Soft cover. Condition: New. Language:Chinese.Author:ZHAO YU LAN WANG JUN YI DENG BIAN ZHU.Binding:Soft cover.Publisher:Tsinghua University Press.

paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: December 2012 Pages: 217 Language: Chinese in Publisher: Tsinghua University Press series of demonstrations of experiments and practice of institutions of higher learning computer textbooks: data structures and algorithms experimental practice tutorial of 9 chapters including program testing measure of the running time. the realization of its application of the linear table and string. stack and queue implementations and applications. recursion. binary tree implementations and applications. Implementation and Application Find Sort Implementation and Application. graph algorithms and their applications and standards Template Library STL About us. Each chapter for commonly used data structures and algorithms. design examples and exercises. some exercises in the book with reference to the answer. Contents: Chapter 1 program testing and run-time metrics the 1.1 program specification program's specifications and test 1.1.1 Description 1.1.2 Programming Exercise: Sort function specification 1.1.3 program testing 1.1.4 programming exercises: Sort test 1.1.6 1.1.5 random number generation automation test 1.1.7 Programming Exercise: Sort the automatic test 1.2 program run-time metrics 1.2.1 obtain 1.2.2 statistical sorting function of the CPU time is running 1.2.3 Programming practice: Sorting the run-time metrics 1.2.4 understand the algorithm time complexity 1.2.5 programming practice: Implementation and Application of the largest contiguous subsequence algorithm computing time comparison Summary Chapter 2 linear table and string 2.1 standard library data structure vector list the 2.1.1 standard library the data structure vector2.1.2 linear table vector applications 2.1.3 Programming practice: vector applications 2.1.4 standard library data structure list2.1.5 linear table application 2.1.6 Programming to practice: line the sexual table Application 2.1.7 Programming Exercise: polynomial representation and arithmetic 2.1.8 programming exercises: 2.2 linear form of abstract data types. set operations achieve its test 2.2.1 Linear table abstract data type definition 2.2.2 Programming practice: the use of an array of linear Table 2.2.3 linear Table 2.2.4 Programming practice: familiar single linked list 2.2.5 Programming to practice: single linear table 2.3 Applications 2.3.1 string data structure linked list using single linked list string string2.3.2 programming practice: the generation of the index table 2.3.3 programming practice: a line editor to achieve Summary Chapter 3 the use of stack and queue implementation and application of the 3.1 standard library stack 3.1.1 STL template class stack3.1.2 programming Exercise: familiar with the operation of the stack and stack 3.2 stack implementation of the 3.2.1 stack of definition 3.2.2 Programming to practice: stack implementation 3.3 Application 3.3.1 STL queue template queue queue3.3.2 queue application examples 3.4 queue 3.4 3.4.2 .1 queue definition programming exercises: queue implementation 3.5.2 3.5 stack and queue the application 3.5.1 compartment scheduling problems programming exercises: compartments scheduling problem 3.5.3 programming exercises: service the queue simulation problems Summary Chapter 4 recursive 4.1 recursive algorithm 4.1.1 recursive function example 4.1.2 a stack of pancakes sort 4.1.3 Programming practice: recursion 4.2 Governing Law 4.2.1 Tower of Hanoi 4.2.2 merge sort 4.2.3 programming exercises: merge sort implementation 4.2.4 recursive algorithm analysis 4.3.3 programming exercises 4.3 backtracking 4.3.1 The eight queens problem 4.3.2 maze problem: backtracking . Chapter 5 Chapter 6 binary tree implementation and application Find Implementation and Application of Chapter 7 sorted Implementation and Application of Chapter 8 Figure algorithm and its application of Chapter 9 of the Standard Template Library STL Introduction Append.

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.

paperback. Condition: New. Pub Date :2006-05-01 Publisher: China Machine Press book fully demonstrate the application of object-oriented technology in the modern theory of data structures. the widespread adoption of technologies such as abstraction. encapsulation and inheritance. The book describes the basic data structures. including stacks. queues. vector. list structure; introduced a number of advanced data structures. including priority queue structure. mapping and dictionary structure search tree structure. Combin.

paperback. Condition: New. Language:Chinese.Paperback. Pub Date: 2020-11-01 Pas: 301 Publisher: Machinery Publishing Society This textbook details the meaning of the data structure. and the method. storage. processing method in linear structure. tree structure. and figure structure. and Detailed discussion on the relevant algorithms of finding and sorting. This textbook includes 3 most. a total of 8 chapters. Part 1: Based on the data structure .