<p>“Uehara’s First course in algorithms through puzzles is an immensely gratifying book to read. It is a neat and short introduction to algorithms, which manages to combine fun with depth. … This reviewer is thinking of employing Uehara's book as recommended reading.” (Michael Soltys, Mathematical Reviews, May, 2020)</p><p>“This is a first course in computer-science algorithms, aimed at undergraduates. … The puzzle parts are the best part of the book. They are concrete, well-explained, and well-motivated, as well as being rigorous computer science.” (Allen Stenger, MAA Reviews, April 22, 2019)</p>
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.
Les mer
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.
Les mer
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.
Les mer
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.
Les mer
“Uehara’s First course in algorithms through puzzles is an immensely gratifying book to read. It is a neat and short introduction to algorithms, which manages to combine fun with depth. … This reviewer is thinking of employing Uehara's book as recommended reading.” (Michael Soltys, Mathematical Reviews, May, 2020)“This is a first course in computer-science algorithms, aimed at undergraduates. … The puzzle parts are the best part of the book. They are concrete, well-explained, and well-motivated, as well as being rigorous computer science.” (Allen Stenger, MAA Reviews, April 22, 2019)
Les mer
Provides an introduction to algorithms in a self-contained way Contains more than 40 exercises and their solutions Includes famous puzzles to explain basic techniques of algorithms
Produktdetaljer
ISBN
9789811331879
Publisert
2019-01-31
Utgiver
Vendor
Springer Verlag, Singapore
Høyde
235 mm
Bredde
155 mm
Aldersnivå
Lower undergraduate, UF, P, 05, 06
Språk
Product language
Engelsk
Format
Product format
Innbundet
Forfatter