Basic Concepts in Data Structures
Seiten
2016
Cambridge University Press (Verlag)
978-1-107-16127-6 (ISBN)
Cambridge University Press (Verlag)
978-1-107-16127-6 (ISBN)
An easy-to-read guide on basic concepts of data structures, this textbook covers the theoretical side to the art of writing computer programs. Designed for undergraduates in any quantitative field, the book covers all the most common data structures.
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.
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.
Shmuel Tomi Klein is Professor of Computer Science at Bar-Ilan University, Israel. His research focuses on data compression, text processing algorithms, lossless image compression, and improvements of deduplication techniques for large scale storage systems. He is a former chief scientist of Bar-Ilan University's Responsa Project, which won the Israel Prize in 2007. He is also a co-author of more than 100 academic publications and 10 patents.
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.
| Erscheinungsdatum | 19.03.2017 |
|---|---|
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 156 x 235 mm |
| Gewicht | 510 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Datenbanken |
| Informatik ► Theorie / Studium ► Algorithmen | |
| ISBN-10 | 1-107-16127-4 / 1107161274 |
| ISBN-13 | 978-1-107-16127-6 / 9781107161276 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
CHF 55,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15
