Data Structures and Algorithms Analysis: . Data structures based on linear relations

✍ Scribed by Xingni Zhou; Zhiyuan Ren; Yanzhuo Ma; Kai Fan; Xiang Ji

• Publisher: De Gruyter
• Year: 2020
• Tongue: English
• Leaves: 308
• Series: Information and Computer Engineering; 6
• Category: Library

✦ Synopsis

Data structures is a key course for computer science and related majors. This book presents a variety of practical or engineering cases and derives abstract concepts from concrete problems. Besides basic concepts and analysis methods, it introduces basic data types such as sequential list, tree as well as graph. This book can be used as an undergraduate textbook, as a training textbook or a self-study textbook for engineers.

• Provides an up-to-date overview of data structures, covering both classical and recent results.
• Presents the advanced theories in an easy-to-understand way.
• Includes exercises, making it also suitable for self-study.

✦ Table of Contents

Contents
Preface
1. Introduction
2. The data structure whose nodes share a linear logical relation – linear list
3. Linear list with restricted operations – stack and queue
4. Sequential list with special contents – multidimensional arrays and strings
Appendix A. Relation graph of data
Appendix B. How to add custom header files
Appendix C. Format of software design manual
Appendix D. Answers to selected exercises
References
Index