Items related to The lead anode mire chemistry analyzes a method 6 parts:The...
The lead anode mire chemistry analyzes a method 6 parts:The measurement amount of iodine of the copper quantity method (Chinese edidion) Pinyin: qian yang ji ni hua xue fen xi fang fa di 6 bu fen : tong liang de ce ding dian liang fa - Softcover
Search results for The lead anode mire chemistry analyzes a method 6 parts:The...
Seller Image
Data structure (C language version of the Computer Science and Technology in the 21st century higher education planning materials)
Published by
Tsinghua University Press, 2011
ISBN 10: 7302242291
ISBN 13: 9787302242291
New
paperback
Seller: liu xing, Nanjing, JS, China
Seller rating 5 out of 5 stars
paperback. Condition: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pages Number: 330 Publisher: Tsinghua University. Pub. Date :2011-09-01 version 1. Data structure (C-language version) is taught in many years data structure of the notes made on the basis of finishing. Including linear table. stacks and queues. binary trees and forests. maps. search. sort. and so a total of 10 chapters. Each chapter with a number of exercises. This book is characterized by: addition to describing data structure subject the basic concepts. basic theory and methods. the special emphasis on data modeling and solution algorithm of thinking. focusing on students ability to abstract modeling. algorithm design capabilities. the algorithm ability of language to describe data structures and application of innovation. Data structure (C-language version). the writing adhere to verbal fluency. easy to understand the guiding ideology. seek to express the concept of rigorous. algorithm analysis in layman's language. both for use as a textbook. but also suitable for use as a self-reference. Written by Cui Jinping. Guo Xiaochun. Wang Xia ed. Contents: Chapter 1 Overview of data structure data structure of the problem 1.1 1.2 1.3 the concept of data structures and algorithm analysis algorithm performance and characteristics of the concept of algorithm 1.3.1 1.3.2 1.3.3 algorithm design algorithm 1.4 Performance Analysis of Data structure of the algorithm described in Exercise 1 Tools Chapter 2 Introduction to linear type linear form in Table 2.1 defines the order of 2.2 linear table storage structure and algorithms stored in the order table 2.2.1 Linear order as the fundamental structure of 2.2.2 algorithm 2.2.3 Application Examples 2.3 linear sequence table table structure and the chain stores a single linked list algorithm 2.3.1 2.3.2 single linked list storage structure to achieve the basic operations of a doubly linked list 2.3.3 2.3.5 2.3.4 circular linked list static linked list Application examples 2.3.6 Single Exercise 2 Chapter 3 stack and queue 3.1 3.1.1 stack stack defines the concept and ADT 3.1.2 stack storage that algorithm 3.2 stack and application examples 3.3 3.3.1 queue queue 3.3.2 ADT queue definition and the definition of storage structures and algorithms 3 Chapter 4 Exercise 4.1 string string ADT concept and definition of the order of 4.2 fixed-length string stored in string structure and algorithm 4.3 and algorithm of the heap storage structure to achieve 4.4 serial simple matching algorithm matching algorithm 4.4.2KMP 4.4.1 4.4.3 string matching algorithm to other stored image Problem 4 Chapter 5 Table 5.1 arrays and broad array of special matrix compression and storage 5.2 5.3 5.3.1 sparse matrix sparse matrix of ternary group of storage structure and the matrix transpose and sparse matrix multiplication 5.3.2 cross-linked storage structure of matrix addition and subtraction with 5.4 generalized the concept of generalized list in Table 5.4.1 and 5.4.2 ADT broad definition of the generalized form of storage 5.4.3 The basic operation algorithm in Table 5.4.4 Examples of applications broad table 5 Chapter 6 Exercise 6.1 binary tree binary tree binary tree concept and definition of the nature of 6.1.1 and 6.1.2 binary nature of the related terms 6.2 two -tree storage structure and storage to create a binary tree structure algorithm 6.2.1 6.2.2 6.3 binary tree construction algorithm and its application binary tree traversal algorithm recursive binary tree traversal algorithm 6.3.1 6.3.2 two non-recursive tree traversal algorithm 6.3.3 6.3.4 binary tree traversal algorithms applied to restore from the binary tree traversal sequences 6.4 6.4.1 clues clues binary definition of a binary tree and binary tree structure 6.4.2 clues The basic operation of the Huffman tree algorithm 6.5 6.5.1 The concept of the Huffman tree construction algorithm 6.5.2 Huffman tree with the application of Chapter 7 Exercise 6 7.1. Seller Inventory # LH7246
Buy New
US$ 61.69
US$ 18.00 shipping
Ships from China to U.S.A.
Ships from China to U.S.A.
Quantity: 10 available