9787508438399 data structures (C language description) - of Higher Vocational new concept of the 21st century(Chinese Edition)

Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date :2006-09-01 Pages: 186 Publisher: Water Power Press title: data structures (C language description) - 21 centuries high new concept Textbook List Price: 20.00 yuan Author: Ma Qiuju editor Press: Water Power Press Publication Date :2006-9-1ISBN: 9787508438399 Words: 306.000 yards: 186 Edition: 1 Binding: Paperback: product size and weight: Editor's Summary book selection are higher vocational The point of the High Commissioner for computers and related professional knowledge. the book is Chapter 9. the main contents include: linear table. stack and queue. an array of special matrix and generalized table. string. tree. Figure. Find and sort etc. Data structures and algorithms involved in each chapter gives popular explanation and class C language description. the focus on the content of which is based on the C language function or procedure given in the form of. at the same time on the machine at the end of each chapter internship given specific application call (run through). which aims to enable readers to be able to learn the knowledge to implement the application. Refining the content of the book. the narrative popular example of persuasive. easy to explain and learning. highlighting practical applicability. The book can be used as a higher vocational schools. colleges. adult colleges and undergraduate institutions organized Secondary Vocational and Technical School of Computer and related professional data structure textbooks. scientific and technical personnel for computer software development and self-reference. Contents Preface Introduction Chapter 1 Overview of the data structure this chapter Learning Objectives 1.1 Why learning algorithm and algorithm 1.3 algorithms and algorithms of data structures 1.2 data structure concepts and terminology 1.2.1 data structure definitions of the basic concepts and terminology 1.2.2 Description 1.3.1 characteristics 1.3.2 algorithm described the 1.4 algorithm time and space efficiency analysis method exercises Chapter 2 Linear Table 2.1.1 of this chapter to learn the logical structure of the target 2.1 linear table definition linear table 2.1.2 the basic operation of the linear form 2.2 linear form chain storage and computing sequential storage structure and order arithmetic real dam 2.2.1 Table 2.2.2 sequence table on basic computing to achieve 2.3 linear table 2.3.2 single basic operation of the linked list to achieve 2.3 2.3.1 single linked list. 3 circular linked list 2.3.4 doubly linked list 2.3.5 Chapter 3 stack and queue as defined in 3.1 stack 3.1.1 stack and basic computing static linked list the 2.3.6 sequence comparison table and linked list 2.4 Typical applications of linear exercises on machines internship the 3.1.2 stack sequential storage structure and operations to achieve the the 3.1.3 stack chain storage structure and operation of the order of 3.2 queue 3.2.1 queue definition and basic operations 3.2.2 queue storage structure and operations to achieve the 3.2.3 queue the chain storage structure and operations to achieve the 3.3 stacks and queues typical application exercises on the machine This chapter learning objectives internship Chapter 4 array of special matrix and generalized table 4.1 array 4.1.1 array of basic concepts 4.1.2-array storage structure 4.2 special matrix 4.2.1 symmetrical compression storage matrix 4.2.2 4.2.3 diagonal triangular matrix the matrix 4.2.4 sparse matrix 4.3 generalized table 4.3.1 the definition and nature of generalized table 4.3.2 generalized list of basic arithmetic exercises on machines internship 5th the 5.2 string storage structure 5.2.1 string stored in the order of the chapter the string this chapter learning objectives 5.1 string defined basic concepts and its basic operations 5.1.1 string 5.1.2 string basic operations 5.2.2 string chain store 5.3 serial computing a 6.2.1 binary tree the basic in 6.2.…