Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
First Course in Algorithms Through Puzzles
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

First Course in Algorithms Through Puzzles

First Course in Algorithms Through Puzzles

Ryuhei Uehara

175 pages, parution le 03/02/2019

Résumé

These detailed solutions will enable readers to follow the author's steps to solve problems and to gain a better understanding of the contents.

Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics.

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.

More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author's steps to solve problems and to gain a better understanding of the contents.

Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.

Chapter 1. Preliminaries.- Chapter 2. Recursive call.- Chapter 3. Algorithms for Searching and Sorting.- Chapter 4. Searching on graphs.- Chapter 5. Backtracking.- Chapter 6. Randomized Algorithms.- Chapter 7. References.- Chapter 8. Answers to exercises. Ryuhei Uehara is a professor in the School of Information Science at the Japan Advanced Institute of Science and Technology. He was a researcher at CANON Inc. Later, he joined Tokyo Woman's Christian University as an assistant professor and was later also a lecturer and associate professor at Komazawa University. He had been a visiting scholar at the University of Waterloo (Canada), the Massachusetts Institute of Technology (USA), Simon Fraser University (Canada), the Universite libre de Bruxelles (Belgium), ETH Zurich (Switzerland), and the Universitat Politecnica de Catalunya (Spain). His research interests include computational complexity, algorithms and data structures, and graph algorithms. He is especially engrossed in computational origami, games, and puzzles from the viewpoints of theoretical computer science. He is one of two translators of the New Martin Gardner Mathematical Library into Japanese.

Caractéristiques techniques

  PAPIER
Éditeur(s) Apress
Auteur(s) Ryuhei Uehara
Parution 03/02/2019
Nb. de pages 175
EAN13 9789811331879

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients sav.client@eyrolles.com
librairie française
Librairie française depuis 1925
Recevez nos newsletters
Vous serez régulièrement informé(e) de toutes nos actualités.
Inscription