Site announcement 站点索引达到 27 万本,AI 搜索完成全面提速 查看
Data Structures cover

Data Structures

No rating yet
Original title
数据结构
Pages
329
Chapters
25
Binding
Paperback
Series
21st Century Higher Education Computer Planning Textbook — Masters Series
ISBN
9787115335913

Tags

Summary

This book is the two-color edition of Data Structures (C Language Edition), 3rd Edition. In terms of content selection and organization, it stays close to the current state and development trends of the Data Structures course in ordinary higher education institutions, conforms to the latest graduate entrance examination syllabus, has moderate difficulty, and emphasizes practicality and application. The book has 8 chapters: Chapter 1 Introduction, Chapter 2 Linear Lists, Chapter 3 Stacks and Queues, Chapter 4 Strings, Arrays, and Generalized Lists, Chapter 5 Trees and Binary Trees, Chapter 6 Graphs, Chapter 7 Searching, and Chapter 8 Sorting. The book uses a C-like language as the description language for data structures and algorithms. It can be used as a textbook for the Data Structures course in computer science and information technology-related majors in ordinary higher education institutions, and can also serve as a reference for scientific and technical workers engaged in computer engineering and applications.

Editor's review

The two-color edition of Data Structures (C Language Edition), 3rd Edition is authored by Li Dongmei, Yan Weimin, and Wu Weimin, and published by Posts & Telecom Press. In terms of content selection and organization, the book stays close to the current state and development trends of the Data Structures course in ordinary higher education institutions, has moderate difficulty, emphasizes practicality and application, conforms to the latest graduate entrance examination syllabus, and has direct reference value for readers preparing for graduate entrance examinations. The book has 8 chapters. Starting with the introduction, it successively covers linear lists, stacks and queues, strings, arrays and generalized lists, trees and binary trees, graphs, searching, and sorting, basically encompassing the core knowledge modules of the Data Structures course. The structure is clear and facilitates step-by-step study. The book uses a C-like language as the description language for data structures and algorithms, making it suitable for readers with some C language foundation to connect abstract data structure concepts with concrete algorithm descriptions and deepen their understanding. The two-color layout helps distinguish key content and improves the reading experience. The book can be used as a textbook for the Data Structures course in computer science and information technology-related majors in ordinary higher education institutions, suitable for undergraduate students for classroom learning and after-class review; it can also serve as a reference for scientific and technical workers engaged in computer engineering and applications, helping them review and consolidate basic knowledge of data structures. For readers preparing for graduate entrance examinations who need to systematically review data structures, the chapter arrangement and difficulty level of this book are also relatively friendly. Overall, this is a data structures textbook with a clear positioning and complete content that balances teaching and examination preparation needs.

Who it's for

A good fit for

  • Undergraduate students majoring in computer science and technology, software engineering, and related fields
  • Candidates preparing for the computer science graduate entrance examination
  • Self-learners who need to systematically study data structures and algorithms
  • Scientific and technical workers engaged in computer engineering and applications

Not a good fit for

  • Readers with no programming foundation at all
  • General readers who only need to understand popular science concepts of data structures

Reading tips

  1. It is recommended to review knowledge of pointers, structures, and functions in C language before studying the algorithm implementations in this book.
  2. Read the chapters in order, focusing on understanding the storage representations and basic operations of structures such as linear lists, trees, and graphs.
  3. Using the C-like code in the book, implement and debug the algorithms hands-on in a compilation environment.
  4. After completing each chapter, do the accompanying exercises to test mastery of knowledge points and algorithm design.
  5. Readers preparing for graduate entrance examinations can refer to the latest examination syllabus to review key chapters and commonly tested algorithms.

About the publisher

Posts & Telecom Press China · Founded in 1953

Posts & Telecom Press is known for its strengths in science and technology, computing, and information and communications titles, and has extended its publishing into photography, art, software learning, and inspirational growth, giving it a fairly diverse range. Its catalog includes computing and communications works such as Refactoring and Patterns (Revised Edition) and Huawei Switch Learning Guide (Second Edition), alongside bilingual collector's editions such as The Little Prince (Chinese-English-French illustrated collector's edition), The Great Gatsby, and Three Days to See. Beijing Ten Years: 1980-1990 and Ghost Blade: WLOP Personal Illustration Collection reflect its presence in photography and art. Its authors include Antoine de Saint-Exupéry, Helen Keller, Joshua Kerievsky, Wang Da, Zhang Zhaozeng, and WLOP.

Contents

  1. Chapter 1 Introduction
  2. 1.1 The Role and Significance of Data Structures
  3. 1.1.1 The Role of Data Structures
  4. 1.1.2 The Significance of Data Structures
  5. 1.2 Basic Concepts and Terminology
  6. 1.2.1 Basic Concepts and Terminology
  7. 1.2.2 Logical Structure and Physical Structure of Data Structures
  8. 1.3 Representation of Data Structures
  9. 1.4 Algorithms and Algorithm Analysis
  10. 1.4.1 Basic Concepts of Algorithms
  11. 1.4.2 Measurement of Algorithm Efficiency
  12. 1.4.3 Analysis of Algorithm Efficiency
  13. 1.5 Exercises and Solutions
  14. Chapter 2 Linear Lists
  15. 2.1 Logical Structure of Linear Lists
  16. 2.1.1 Concept of Linear Lists
  17. 2.1.2 Basic Operations of Linear Lists
  18. 2.1.3 Abstract Data Type Description of Linear Lists
  19. 2.2 Sequential Representation and Implementation of Linear Lists
  20. 2.2.1 Sequential Representation of Linear Lists
  21. 2.2.2 Implementation of Sequential Lists
  22. 2.2.3 Applications of Sequential Lists
  23. 2.3 Linked Representation and Implementation of Linear Lists
  24. 2.3.1 Linked Representation of Linear Lists
  25. 2.3.2 Implementation of Singly Linked Lists

FAQ

What language does this book use to describe data structures and algorithms?
The book uses a C-like language as the description language for data structures and algorithms, suitable for readers who already have a C language foundation. The algorithm examples in the book balance readability and practicality, making it easy for readers to understand and convert them into runnable programs.
What are the main changes in the 3rd edition compared with the 2nd edition?
According to the publication information, the 3rd edition is a two-color edition. While maintaining the original 8-chapter content framework, it stays close to the current course state and development trends, conforms to the latest graduate entrance examination syllabus, has moderate difficulty, emphasizes practicality and application, and uses two-color printing to improve the reading experience.
Is this book suitable as a review textbook for graduate entrance examinations?
The content organization of this book conforms to the latest graduate entrance examination syllabus and covers core examination points such as linear lists, stacks, queues, strings, arrays, trees, graphs, searching, and sorting. It can be used as a reference textbook for computer science graduate entrance examination review, and it is recommended to use it in combination with the examination requirements of the target institution.
What chapters does the book contain?
The book has 8 chapters: Chapter 1 Introduction, Chapter 2 Linear Lists, Chapter 3 Stacks and Queues, Chapter 4 Strings, Arrays, and Generalized Lists, Chapter 5 Trees and Binary Trees, Chapter 6 Graphs, Chapter 7 Searching, and Chapter 8 Sorting. The content covers the main knowledge points of the Data Structures course.
What prior foundation is needed to read this book?
It is recommended that readers first master the basic syntax of C language, especially pointers, structures, functions, and dynamic memory allocation, so as to understand the algorithms and storage structures described in C-like language in the book. A foundation in discrete mathematics is also helpful for learning.

Comments

Find this book

This site is an index: you start “Search all sources” in your browser, and the entries it lists all point to third-party sites; please judge their availability yourself.

About the author

Yang Jian Author · Chinese

Yang Jian is a Chinese author of books on business management. He graduated in 1991 from Minzu University of China with a major in economic management, and has worked at institutions including the Shenzhen Research Institute of Comprehensive Development, Hong Kong Chinese-language publishers, and the Financial Union Group; he is currently deputy general manager of Shenzhen Huaxin Zhiyuan Enterprise Management Consulting. His writing focuses on grassroots management and organizational practice. His "Excellent Team Leader" series, published by China Textile Press, has sold more than 200,000 copies and has had some influence in team building and frontline management training. Recent titles in the collection also touch on foreign literature, applied psychology, programming design, and general computing, reflecting wide-ranging interests. Public information is limited, so his birth and death dates and further personal details remain unknown; his books are generally concise and practical in format and aimed at general readers.

Bai Zhongjian Author

Bai Zhongjian is a Chinese author of programming books, about whom very limited public information is available; what can be confirmed centers mainly on the work published under his name. His work in the database is C++ Programming: A Modern Approach, which falls under the category of programming design. Judging from the title and category, the book is intended for learners of the C++ language and takes modern approaches to program design as its entry point, likely covering basic C++ syntax, program design thinking, and modern programming practice. Since the author's educational background, professional experience, and research interests have not been publicly disclosed, it is difficult to assess the full picture of his writing style; however, the choice of topic suggests that the author is concerned with presenting C++, a relatively complex language, to readers in a systematic and modern way. For readers who wish to learn about C++ program design, the book can serve as one reference. Overall, Bai Zhongjian has few publicly available publications, and his author profile rests mainly on this single work, with further personal information still awaiting supplementary material.

Ding Xiaofeng Author

Ding Xiaofeng: publicly available information is limited. What can be confirmed at present is that Ding is an author of computer science books, with only one work held in the collection, Data Structures. The book is classified under general computer science and falls within the common subject area of foundational computer science textbooks, covering basic knowledge about data organization, storage, and algorithms. Based on the available information, Ding's writing is aimed at classroom teaching and introductory learning, focusing on turning abstract data structure concepts into an understandable framework of knowledge to serve university courses in computer science and related fields. Because there are few records of Ding's life, positions, or writing background, a complete assessment of Ding's academic experience and overall body of work is not yet possible. Nevertheless, as a single work, Data Structures serves to popularize foundational knowledge and support coursework; it is a suitable entry point for understanding the author's writing orientation and is currently the main basis for identifying Ding Xiaofeng as an author.