Algorithms and Data Structures
Foundations and Probabilistic Methods for Design and Analysis
Seiten
2020
|
1st ed. 2020
Springer International Publishing (Verlag)
978-3-030-59757-3 (ISBN)
Springer International Publishing (Verlag)
978-3-030-59757-3 (ISBN)
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.
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.
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 and bachelor's and master's levels. He is the coauthor of the successful textbook Introduction to Cryptography, now in its 3rd edition.
Introduction.- Sorting and Searching.- Hashing.- Trees.- Graphs.- Weighted Graphs.- App. A, Probabilities.- App. B, Mathematical Terminology and Useful Formulas.- References.- Symbols.- Index.
| Erscheinungsdatum | 03.11.2020 |
|---|---|
| Zusatzinfo | XI, 349 p. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 703 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Analysis | |
| Schlagworte | algorithms • data structures • Graphs • Hashing • probabilistic methods • randomized algorithms • Searching • sorting • Trees |
| ISBN-10 | 3-030-59757-1 / 3030597571 |
| ISBN-13 | 978-3-030-59757-3 / 9783030597573 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Eine Einführung mit Java
Buch | Hardcover (2020)
dpunkt (Verlag)
CHF 62,85
Praktische Übungen für die Vorlesungen und Praktika
Buch (2022)
Hanser, Carl (Verlag)
CHF 69,95
