Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithms and Data Structures de Helmut Knebl

Algorithms and Data Structures

Autor Helmut Knebl
en Limba Engleză Hardback – noi 2020
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.
Citește tot Restrânge

Preț: 53107 lei

Preț vechi: 66384 lei
-20%

Puncte Express: 797
Paperback 36699 lei
Hardback 53107 lei

Carte tipărită la comandă

Livrare economică 26 noiembrie-10 decembrie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030597573
ISBN-10: 3030597571
Pagini: 364
Ilustrații: XI, 349 p.
Dimensiuni: 160 x 241 x 26 mm
Greutate: 0.66 kg
Ediția:1st ed. 2020
Editura: 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. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures. Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.

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