Newly Edited Data Structures Tutorial

Author: Ma Chunjiang et al.
Publisher:
Publishing Date: 2006-03-01
Features: Data structures are a fundamental theoretical and professional knowledge for computer science and related fields. This book systematically introduces ten major structures, including linear lists, stacks, queues, strings, two-dimensional arrays, general lists, trees, forests, binary trees, and graphs, laying a solid foundation for subsequent courses such as operating systems, compiler principles, and database principles. The book also delves into the comprehensive application of various data structures and programming techniques in the fields of searching and sorting, and concludes with an introductory overview of file systems. Additionally, it covers the three major control structures of programming design (sequence, selection, and iteration), function calls, and the "point-style thinking" methodology in computer programming.
The main features of this book include a well-structured chapter layout with a gradual increase in difficulty, easy-to-understand language, abundant illustrations, strong hints, detailed case studies and analyses, making it suitable for both teaching and self-study. It particularly emphasizes the origins and background knowledge of data structures, with algorithm design adhering to software engineering standards and providing executable source code for selected examples.
This book is primarily intended as a textbook for undergraduate and vocational college students majoring in computer science, computer applications, software engineering, and related fields. It can also be used as a learning resource for computer programming training courses and enthusiasts.
Data structures are a fundamental theoretical and professional knowledge for computer science and related fields. This book systematically introduces ten major structures, including linear lists, stacks, queues, strings, two-dimensional arrays, general lists, trees, forests, binary trees, and graphs, laying a solid foundation for subsequent courses such as operating systems, compiler principles, and database principles. The book also delves into the comprehensive application of various data structures and programming techniques in the fields of searching and sorting, and concludes with an introductory overview of file systems. Additionally, it covers the three major control structures of programming design (sequence, selection, and iteration), function calls, and the "point-style thinking" methodology in computer programming.
The main features of this book include a well-structured chapter layout with a gradual increase in difficulty, easy-to-understand language, abundant illustrations, strong hints, detailed case studies and analyses, making it suitable for both teaching and self-study. It particularly emphasizes the origins and background knowledge of data structures, with algorithm design adhering to software engineering standards and providing executable source code for selected examples.
This book is primarily intended as a textbook for undergraduate and vocational college students majoring in computer science, computer applications, software engineering, and related fields. It can also be used as a learning resource for computer programming training courses and enthusiasts.