الفهرس الالي لمكتبة كلية العلوم الدقيقة و الاعلام الالي
Résultat de la recherche
1 résultat(s) recherche sur le mot-clé 'correctness'
Affiner la recherche Générer le flux rss de la recherche
Partager le résultat de cette recherche Interroger des sources externes
Algorithms and data structures / Jeffrey H. Kingston
Titre : Algorithms and data structures : design, correctness, analysis / Type de document : texte imprimé Auteurs : Jeffrey H. Kingston Mention d'édition : 2nd ed. Editeur : Harlow, England : Addison-Wesley Année de publication : 19971998 Collection : International computer science series Importance : xi, 380 p. Présentation : ill. Format : 24 cm x 15 cm ISBN/ISSN/EAN : 978-0-201-40374-9 Mots-clés : Algorithms data structures design correctness analysis Index. décimale : 005 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.
Algorithms and data structures : design, correctness, analysis / [texte imprimé] / Jeffrey H. Kingston . - 2nd ed. . - Harlow, England : Addison-Wesley, 19971998 . - xi, 380 p. : ill. ; 24 cm x 15 cm. - (International computer science series) .
ISBN : 978-0-201-40374-9
Mots-clés : Algorithms data structures design correctness analysis Index. décimale : 005 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.
Réservation
Réserver ce document
Exemplaires (2)
Code-barres Cote Support Localisation Section Disponibilité fsei01192 005-164.1 Ouvrage Faculté des Sciences Exactes et Informatique 000 - Informatique, information, ouvrages généraux Disponible fsei01191 005-164.2 Ouvrage Faculté des Sciences Exactes et Informatique 000 - Informatique, information, ouvrages généraux Disponible