Algorithmic Puzzles

— —

Anany Levitin (Professor of Computing Sciences, Professor of Computing Sciences, Department of Computing Sciences, Villanova University) Maria Levitin (Software Developer, Software Developer, (independent consultant))

Algorithmic Puzzles

Anany Levitin (Professor of Computing Sciences, Professor of Computing Sciences, Department of Computing Sciences, Villanova University), Maria Levitin (Software Developer, Software Developer, (independent consultant))

$77.95

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Oxford University Press
27 October 2011

Mathematics & Sciences; Algorithms & data structures; Puzzles & quizzes

While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.

By: Anany Levitin (Professor of Computing Sciences Professor of Computing Sciences Department of Computing Sciences Villanova University), Maria Levitin (Software Developer, Software Developer, (independent consultant))
Imprint: Oxford University Press
Country of Publication: United States
Dimensions: Height: 155mm, Width: 234mm, Spine: 15mm
Weight: 404g
ISBN: 9780199740444
ISBN 10: 0199740445
Pages: 336
Publication Date: 27 October 2011
Audience: General/trade , ELT Advanced
Format: Paperback
Publisher's Status: Active

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

Reviews for Algorithmic Puzzles

Indeed, I would say that this is a book that any mathematical puzzle enthusiast ought to consider buying. * Martin Griffiths, The Mathematical Gazette *