Data Structures and Algorithms: An Object-Oriented Approach Using Ada 95: Undergraduate Texts in Computer Science
Autor John Beidleren Limba Engleză Hardback – 30 oct 1996
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 323.38 lei 6-8 săpt. | |
Springer – 4 oct 2012 | 323.38 lei 6-8 săpt. | |
Hardback (1) | 329.47 lei 39-44 zile | |
Springer – 30 oct 1996 | 329.47 lei 39-44 zile |
Preț: 329.47 lei
Preț vechi: 411.84 lei
-20% Nou
Puncte Express: 494
Preț estimativ în valută:
63.08€ • 68.34$ • 52.67£
63.08€ • 68.34$ • 52.67£
Carte tipărită la comandă
Livrare economică 09-14 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780387948348
ISBN-10: 0387948341
Pagini: 364
Ilustrații: XVI, 364 p.
Dimensiuni: 178 x 254 x 26 mm
Greutate: 0.77 kg
Ediția:1997
Editura: Springer
Colecția Springer
Seria Undergraduate Texts in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 0387948341
Pagini: 364
Ilustrații: XVI, 364 p.
Dimensiuni: 178 x 254 x 26 mm
Greutate: 0.77 kg
Ediția:1997
Editura: Springer
Colecția Springer
Seria Undergraduate Texts in Computer Science
Locul publicării:New York, NY, United States
Public țintă
Lower undergraduateCuprins
1 Preliminaries.- 1.1 Object-Oriented Software Development.- 1.2 Problem Analysis.- 1.3 Solution Design.- 1.4 Design to Implementation.- 1.5 Software Maintenance.- 1.6 Data Structures and Algorithms.- 1.7 Ada 95.- 1.8 Simple Static Types.- 1.9 Structured Data Types.- 1.10 Explorations.- 2 Encapsulation.- 2.1 Concept.- 2.2 Packaging Fundamentals.- 2.3 Using Generic Packages.- 2.4 Object-Oriented Support.- 2.5 Using Object-Oriented Packaging.- 2.6 A Taxonomy of Client/Package Visibility.- 2.7 Composability.- 2.8 Child Units.- 2.9 Explorations.- 3 Stacks.- 3.1 Linear Structures.- 3.2 Elementary Stacks.- 3.3 Advanced Features.- 3.4 Iterators.- 3.5 Explorations.- 4 Queues.- 4.1 Elementary Queues.- 4.2 Advanced Features.- 4.3 Iterators.- 4.4 Explorations.- 5 Lists.- 5.1 Recursive Paradigm.- 5.2 Positional Paradigm.- 5.3 Explorations.- 6 Trees.- 6.1 Nonlinear Structures.- 6.2 Binary Trees, Positional Paradigm.- 6.3 Binary Trees, Recursive Paradigm.- 6.4 Tree Traversals.- 6.5 Complete Trees.- 7 Tree Applications.- 7.1 Tree Restructuring.- 7.2 Heaps.- 7.3 Dictionary Trees.- 7.4 Explorations.- 8 Graphs.- 8.1 Graphs and Digraphs.- 8.2 Digraph Specifications.- 8.3 Matrix Representation.- 8.4 Table Representation.- 8.5 Dynamic Representation.- 8.6 Applications.- 8.7 Explorations.- 9 Sets.- 9.1 Specifications.- 9.2 Static Representation.- 9.3 Dynamic Representation.- 9.4 Hashing Representation.- 9.5 Hamming Codes.- 9.6 Bags.- 9.7 Explorations.- 10 Strings.- 10.1 Specifications.- 10.2 Static Representations.- 10.3 Dynamic Representations.- 10.4 String Search Algorithms.- 10.5 Tradeoffs.- 10.6 Explorations.- 11 Sorting.- 11.1O(n2)Sorts.- 11.2 Better Sorts.- 11.3O(nlogn)Sorts.- 11.4 Explorations.- 12 Search/Update.- 12.1 Sequential Search.- 12.2 Bisection Method Search.- 12.3 Block Sequential Search/Update.- 12.4 Address Calculation Search/Update.- 12.5 Hashing.- 12.6 Evaluation.- 12.7 Explorations.- References.