Algorithms data structures foundations par knebl helmut (25 résultats)

paperback. Etat : Very Good.

Etat : New.

Etat : New. 2020th edition NO-PA16APR2015-KAP.

Etat : New.

Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Paperback. Etat : New.

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. …

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New.

Paperback. Etat : New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Taschenbuch. Etat : Neu. Algorithms and Data Structures | Foundations and Probabilistic Methods for Design and Analysis | Helmut Knebl | Taschenbuch | xi | Englisch | 2021 | Springer | EAN 9783030597603 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Hardcover. Etat : Brand New. 360 pages. 9.25x6.10x9.21 inches. In Stock.

Etat : Hervorragend. Zustand: Hervorragend | Seiten: 364 | Sprache: Englisch | Produktart: Bücher | 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.…

Hardcover. Etat : New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.