Algorithmic puzzles are puzzles involving well-defined procedures for solving problems. This book will provide an enjoyable and accessible introduction to algorithmic puzzles that will develop the reader's algorithmic thinking. The first part of this book is a tutorial on algorithm design strategies and analysis techniques. Algorithm design strategies -- exhaustive search, backtracking, divide-and-conquer and a few others -- are general approaches to designing step-by-step instructions for solving problems. Analysis techniques are methods for investigating such procedures to answer questions about the ultimate result of the procedure or how many steps are executed before the procedure stops. The discussion is an elementary level, with puzzle examples, and requires neither programming nor mathematics beyond a secondary school level. Thus, the tutorial provides a gentle and entertaining introduction to main ideas in high-level algorithmic problem solving. The second and main part of the book contains 150 puzzles, from centuries-old classics to newcomers often asked during job interviews at computing, engineering, and financial companies. The puzzles are divided into three groups by their difficulty levels. The first fifty puzzles in the Easier Puzzles section require only middle school mathematics. The sixty puzzle of average difficulty and forty harder puzzles require just high school mathematics plus a few topics such as binary numbers and simple recurrences, which are reviewed in the tutorial. All the puzzles are provided with hints, detailed solutions, and brief comments. The comments deal with the puzzle origins and design or analysis techniques used in the solution. The book should be of interest to puzzle lovers, students and teachers of algorithm courses, and persons expecting to be given puzzles during job interviews.

au.com.bandaconsulting.shop.book.beans.Description@29ffbbde

By:   Anany Levitin, Maria Levitin
Imprint:   Oxford University Press
Country of Publication:   United States
Dimensions:   Height: 233mm,  Width: 156mm,  Spine: 27mm
Weight:   404g
ISBN:  

9780199740444

ISBN 10:   0199740445
Pages:   336
Publication Date:   January 2012
Audience:   General
Format:   Paperback
Publisher's Status:   Active
Availability:   In stock at Abbey's Bookshop
This is in stock in our store and available now.

PREFACE; LIST OF PUZZLES; TUTORIAL PUZZLES; MAIN SECTION PUZZLES; 1. TUTORIALS; GENERAL STRATEGIES FOR ALGORITHM DESIGN; ANALYSIS TECHNIQUES; 2. PUZZLES; EASIER PUZZLES (#1 - #50); MEDIUM DIC CULTY PUZZLES (51 - 110); HARDER PUZZLES (#111 - 150); 3. HINTS; 4. SOLUTIONS; REFERENCES; DESIGN STRATEGY AND ANALYSIS INDEX; INDEX OF TERMS AND NAMES

<br> Algorithmic Puzzles by Anany Levitin and Maria Levitin is an interesting and novel style of puzzle book. The emphasis lies in training the reader to think algorithmically and develop new puzzle-solving skills: the majority of puzzles are problems where we are asked to find the shortest distance or the fewest moves to get from A to B, or construct a proof that a puzzle has no solution. the book provides plenty of puzzles to keep even the most avid problem-solvers busy for a long time, all with varying levels of difficulty and different styles/contexts. The solutions provided are comprehensive and explain themselves in a friendly, constructive manner, complete with illustrations. In addition to questions and answers, a section of brief hints is also provided to assist the reader in their puzzle-solving endeavours. -- Graham Wheeler, Significance<br><p><br>