Titre : | Algorithms and data structures : design , correction analysis | Type de document : | texte imprime | Auteurs : | Jeffrey Kingston, Auteur | Editeur : | London : -Wesley | Année de publication : | cop. 1990 | Collection : | International computer science series | Importance : | (IX, 315 p.) | Présentation : | ill | Format : | 23 cm | ISBN/ISSN/EAN : | 978-0-201-41705-0 | Note générale : | Bibliogr. p. 304-307. Index | Langues : | Français | Catégories : | Programmation des ordinateurs, logiciels, organisation des données
| Mots-clés : | Data structures (Computer science) Computer algorithms Algorithmes Structures de données (informatique) | Index. décimale : | 00573 | Résumé : |
Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds. | Permalink : | ./index.php?lvl=notice_display&id=14253 |
Algorithms and data structures : design , correction analysis [texte imprime] / Jeffrey Kingston, Auteur . - London : -Wesley, cop. 1990 . - (IX, 315 p.) : ill ; 23 cm. - ( International computer science series) . ISBN : 978-0-201-41705-0 Bibliogr. p. 304-307. Index Langues : Français Catégories : | Programmation des ordinateurs, logiciels, organisation des données
| Mots-clés : | Data structures (Computer science) Computer algorithms Algorithmes Structures de données (informatique) | Index. décimale : | 00573 | Résumé : |
Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds. | Permalink : | ./index.php?lvl=notice_display&id=14253 |
|  |