Data Structures and Algorithms

Author: Qi Dezhu
Publisher:
Publish Date: 2003-10-01
Features: This book includes two parts: data structures and algorithm design methods. The data structures part focuses on introducing the object-oriented abstraction and implementation of basic data objects such as lists, stacks, queues, trees, and graphs involved in computer programming. The algorithm design methods part introduces fundamental algorithm design strategies and techniques, including stepwise refinement, exhaustive search, iteration, recursion, divide and conquer, backtracking, branch and bound, dynamic programming, and greedy algorithms. The data structures part of this book emphasizes data abstraction and object-oriented design, serving as an update and expansion of traditional "Data Structures" courses. It assigns new connotations and processing methods to basic data structures from the perspectives of abstraction and class libraries, elevating them to object-oriented data structures—distinguishing itself from textbooks that describe data structures using C++. The book is rich in content, covering the latest teaching syllabi for "Data Structures and Algorithms" courses both domestically and internationally—ACM and IEEE/CSCC 2001, as well as the "2002 Curriculum for Computer Science and Technology" in China. It forms distinct features and is suitable as a textbook for undergraduate computer science majors or graduate students from non-computer science disciplines in "Data Structures and Algorithms." It can also be used as a continuing education resource for software designers and programmers studying object-oriented programming.