2019, ISBN: 9783030252083

[ED: Hardcover], [PU: Springer / Springer International Publishing / Springer, Berlin], This textbook is a concise introduction to the basic toolbox of structures that allow efficient org… Mehr…

[ED: Hardcover], [PU: Springer / Springer International Publishing / Springer, Berlin], This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shifttowards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java. 1st ed. 2019. 2019. xv, 509 S. XV, 509 p. 235 mm Versandfertig in 6-10 Tagen, DE, [SC: 0.00], Neuware, gewerbliches Angebot, Offene Rechnung (Vorkasse vorbehalten)<

ISBN: 9783030252083

This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic tech… Mehr…

This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. The authors aim for a balance between simplicity and efficiency, between theory and practice, and between classical results and the forefront of research. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, optimization, collective communication and computation, and load balancing. The authors also discuss important issues such as algorithm engineering, memory hierarchies, algorithm libraries, and certifying algorithms. Moving beyond the sequential algorithms and data structures of the earlier related title, this book takes into account the paradigm shift towards the parallel processing required to solve modern performance-critical applications and how this impacts on the teaching of algorithms. The book is suitable for undergraduate and graduate students and professionals familiar with programming and basic mathematical language. Most chapters have the same basic structure: the authors discuss a problem as it occurs in a real-life situation, they illustrate the most important applications, and then they introduce simple solutions as informally as possible and as formally as necessary so the reader really understands the issues at hand. As they move to more advanced and optional issues, their approach gradually leads to a more mathematical treatment, including theorems and proofs. The book includes many examples, pictures, informal explanations, and exercises, and the implementation notes introduce clean, efficient implementations in languages such as C++ and Java. Fremdsprachige Bücher 24.1 x 16.0 x 3.4 cm , Springer, Springer<

2019, ISBN: 9783030252083

Gebundene Ausgabe

Springer, Gebundene Ausgabe, Auflage: 1st ed. 2019, 524 Seiten, Publiziert: 2019-09-11T00:00:01Z, Produktgruppe: Buch, 0.95 kg, Verkaufsrang: 1453353, Informatik, IT-Ausbildung & -Berufe,… Mehr…

Springer, Gebundene Ausgabe, Auflage: 1st ed. 2019, 524 Seiten, Publiziert: 2019-09-11T00:00:01Z, Produktgruppe: Buch, 0.95 kg, Verkaufsrang: 1453353, Informatik, IT-Ausbildung & -Berufe, Computer & Internet, Kategorien, Bücher, Algorithmen, Programmierung & Webdesign, Lexika, Hand- & Jahrbücher, Schule & Lernen, Ingenieurwissenschaft & Technik, Naturwissenschaften & Technik, Mathematik, Fremdsprachige Bücher, Featured Categories, Englische Bücher, 7c9a6c79-19ea-4dea-90da-d7d47042d341_2301, 7c9a6c79-19ea-4dea-90da-d7d47042d341_0, Arborist Merchandising Root, Springer, 2019<

2019, ISBN: 9783030252083

Gebundene Ausgabe

[ED: Gebunden], [PU: Springer International Publishing], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Every computer scientist and ever… Mehr…

[ED: Gebunden], [PU: Springer International Publishing], Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Every computer scientist and every professional programmer should know about the basic algorithmic toolboxAuthors address the paradigm shift towards the paralle, DE, [SC: 0.00], Neuware, gewerbliches Angebot, Hardcover, 509, [GW: 912g], 1. Auflage 2019, Banküberweisung, PayPal, [CT: Naturwissenschaft/Mathematik / Sonstiges - Naturwissenschaften]<