Basic Concepts in Data Structures

This concise text offers an accessible, conceptual presentation for students in any quantitative field.

Shmuel Tomi Klein (Author)

9781107161276, Cambridge University Press

Hardback, published 28 October 2016

228 pages
23.5 x 15.6 x 1.6 cm, 0.51 kg

Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a problem efficiently rather than technical implementation details. The text includes pseudocode and covers all the most common data structures, such as queues, stacks, trees, heaps, and hash tables, along with the basics of searching, sorting, and coding. This book can supplement any undergraduate algorithms or discrete math course and will also be accessible to students and researchers in other quantitative disciplines. No prerequisites beyond introductory programming and basic mathematics are required, and the accessible, conceptual presentation will appeal to undergraduates in many quantitative fields. Carefully designed problem sets with selected solutions will allow students to test their understanding.

1. Why data structures? A motivating example
2. Linear lists
3. Graphs
4. Trees
5. AVL trees
6. B-trees
7. Heaps
8. Sets
9. Hash tables
10. Sorting
11. Codes.

Subject Areas: Algorithms & data structures [UMB], Discrete mathematics [PBD]