First Course in Algorithms Through Puzzles

Authors: Uehara, Ryuhei

Free Preview
  • 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
see more benefits

Buy this book

eBook $39.99
price for USA in USD (gross)
  • ISBN 978-981-13-3188-6
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $54.99
price for USA in USD
  • ISBN 978-981-13-3187-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

About the authors

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 Université libre de Bruxelles (Belgium), ETH  Zürich (Switzerland), and the Universitat Politècnica 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.

Reviews

“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)


Table of contents (8 chapters)

Table of contents (8 chapters)

Buy this book

eBook $39.99
price for USA in USD (gross)
  • ISBN 978-981-13-3188-6
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $54.99
price for USA in USD
  • ISBN 978-981-13-3187-9
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
First Course in Algorithms Through Puzzles
Authors
Copyright
2019
Publisher
Springer Singapore
Copyright Holder
Springer Nature Singapore Pte Ltd.
eBook ISBN
978-981-13-3188-6
DOI
10.1007/978-981-13-3188-6
Hardcover ISBN
978-981-13-3187-9
Edition Number
1
Number of Pages
XI, 175
Number of Illustrations
65 b/w illustrations, 3 illustrations in colour
Topics