Algorithms and Data Structures: Foundations and Probabilistic Methods for Design and Analysis
Autor Helmut Kneblen Limba Engleză Hardback – noi 2020
This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 350.27 lei 6-8 săpt. | |
| Springer International Publishing – 2 noi 2021 | 350.27 lei 6-8 săpt. | |
| Hardback (1) | 493.16 lei 6-8 săpt. | |
| Springer International Publishing – noi 2020 | 493.16 lei 6-8 săpt. |
Preț: 493.16 lei
Preț vechi: 616.45 lei
-20% Nou
Puncte Express: 740
Preț estimativ în valută:
87.26€ • 102.47$ • 76.59£
87.26€ • 102.47$ • 76.59£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030597573
ISBN-10: 3030597571
Pagini: 349
Ilustrații: XI, 349 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.69 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3030597571
Pagini: 349
Ilustrații: XI, 349 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.69 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Locul publicării:Cham, Switzerland
Cuprins
Introduction.- Sorting and Searching.- Hashing.- Trees.- Graphs.- Weighted Graphs.- App. A, Probabilities.- App. B, Mathematical Terminology and Useful Formulas.- References.- Symbols.- Index.
Notă biografică
Prof. Dr. Helmut Knebl is a researcher and lecturer in the Faculty of Informatics of the Technische Hochschule Nürnberg Georg Simon Ohm, where he has taught courses on the topic of this book to students of computer science, media, and business informatics at bachelor's and master's levels. He is the coauthor of the successful textbook Introduction to Cryptography, now in its 3rd edition.
Textul de pe ultima copertă
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.
This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises.
Caracteristici
A central topic in any computer science curriculum Author considers probabilistic methods as being fundamental for the construction of simple and e?cient algorithms Suitable for undergraduate and graduate students of computer science, mathematics, and engineering