Data Structures and Algorithms

Name: Data Structures and Algorithms
ISBN: 9787301155844

佟伟光Peking University Press · ChinaAug 2025

3.3

Word count: 69 words
Chapters: 8
ISBN: 9787301155844

Report an error Find this book

Summary

This book systematically introduces the basic concepts and basic algorithms of data structures, covers all the basic knowledge points of data structures, and highlights the most important and most fundamental content so that students can firmly grasp it and flexibly apply data structure knowledge to solve practical problems.

This book is suitable as a textbook for data structures courses in applied undergraduate institutions and adult education institutions, as well as data structures training classes, and can also serve as a self-study reference book for software professionals.

Editor's review

This book is aimed at foundational teaching of data structures courses, systematically introducing basic concepts and basic algorithms, covering the main knowledge points of data structures while deliberately highlighting the most important and most fundamental content rather than trying to cover everything. For students at applied undergraduate and adult education institutions, this trade-off is friendly: first build a solid grasp of core content such as linear lists, trees, graphs, searching, and sorting, then talk about flexible application. The book emphasizes using data structure knowledge to solve practical problems, making it suitable as a course textbook to accompany classroom teaching and also as a self-study reference for software professionals. When reading, it is recommended to combine concept understanding, algorithm description, and hands-on implementation—after learning each knowledge point, try to reproduce it in code or pseudocode, avoiding merely understanding the conclusions. For readers who need to build a solid foundation and prepare for course exams or job interviews, this book can serve as a relatively stable main line of study.

Who it's for

A good fit for

Students in data structures courses at applied undergraduate institutions who need a textbook aligned with classroom teaching
Learners at adult education institutions who hope to master data structure foundations with relatively concise content
Software practitioners who need to systematically review basic concepts and basic algorithms of data structures
Readers preparing for course exams or technical interviews who want to build a solid foundation in data structures

Not a good fit for

Readers who need in-depth study of advanced algorithm topics or competition-level algorithm design
Developers seeking extensive engineering cases and complete project-based practical content
Learners who have already systematically studied data structures and seek frontier research or in-depth implementation in specific languages

Reading tips

First read through the basic concepts and algorithm ideas in each chapter, then reproduce them in pseudocode or a programming language you know, avoiding reading without practice.
Focus on the most fundamental and commonly used data structures and algorithms; first aim for firm mastery, then expand into details.
After finishing a chapter, close the book and draw the structure diagrams and write the operation steps yourself, then check against the book to identify misunderstandings.
Read alongside course progress, combining the book's algorithms with exercises to test whether you can truly apply them to practical problems

About the publisher

Peking University Press China · Founded in 1979

Peking University Press is a comprehensive university press whose publishing areas cover classical literature, popular science, social culture, world history, Western philosophy, and culture. Its catalogue contains 6,031 titles, with representative books including A Dream of Red Mansions, Relativity: The Special and General Theory (15th Edition) (with Einstein's classic papers on unified field theory and other topics), Elements, Conics, The Aristocratic Families of the Eastern Jin, The Philosophy of Mythology (Volume I), The Philosophy of Mythology (Volume II), and The Origin of Continents and Oceans. Representative authors include Cao Xueqin, Zhou Ruchang, Albert Einstein, Euclid, Apollonius, Tian Yuqing, Schelling, and Xian Gang. The press has developed distinctive strengths in classical Chinese literature and in the translation of Western philosophical classics, while also covering scientific classics and social and cultural studies. As public information is limited, this description is based only on the books in the catalogue and offers no further extrapolation.

版权信息
1
2
3
4
5
6
7

FAQ

Is this book suitable for someone with no data structures background to study on their own?

It can be used as an introductory textbook. The book systematically introduces basic concepts and basic algorithms and highlights the most important and most fundamental content, making it easier for beginners to grasp firmly. It is recommended to read chapters in order, first understanding concepts and algorithm ideas, then reproducing them by hand; when encountering difficulties, combine classroom explanations or basic programming exercises to digest them gradually, and avoid skipping too much.

How comprehensive is the book's coverage? Will it miss important knowledge points?

The book covers the basic concepts and basic algorithms of data structures, includes all the basic knowledge points of data structures, and highlights the most important and most fundamental content. The editorial choices favor helping students grasp firmly and apply flexibly rather than piling up extensive additional content. If readers need more advanced topics, they can supplement after mastering the book's foundations.

How should software professionals use this book as a self-study reference?

Software professionals can use it as a basic reference for systematic review, focusing on revisiting the ideas and applicable scenarios of basic concepts and basic algorithms. It is recommended to use a programming language you are familiar with to turn the book's algorithm descriptions into runnable code and verify results with small-scale data. This both fills gaps and converts book knowledge into practical coding ability.

As a course textbook, how can it be used with classroom learning for better results?

It is recommended to preview the basic concepts of a chapter before class, focus on algorithm ideas and difficult points in class, and promptly reproduce and complete exercises after class. The book's content is concise and highlights key points, suitable for progressing chapter by chapter with the course. Do not treat the textbook as merely a review outline; when encountering algorithm descriptions, draw diagrams or write pseudocode yourself to discover gaps in understanding more quickly.

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

佟伟光 Author

Tong Weiguang is one of the authors of Chinese computer science books. Public information about him is limited, and the only confirmed work available is Data Structures and Algorithms, a title commonly classified under general computer science. This work suggests that Tong Weiguang's writing focuses on the fundamentals of computer science, covering core topics such as ways of organizing data and algorithm design, in a textbook-style approach that systematically sets out basic knowledge for learners. The title Data Structures and Algorithms itself points to a main course in computer science education, indicating that the content is intended for course study and foundational training. Because only this one work is held and no information is available on the author's life, professional background, or institutional affiliation, his career and full body of work cannot be described further. Overall, Tong Weiguang's publicly available writings are few, and the existing work reflects an attention to basic computer science teaching that may serve learners in related courses.