Skip to main content

Puzzles for programmers and pros

0.0
Browse all genres
ISBN
9780470121689

Puzzles for programmers and pros è un puzzles, mathematical recreations book di Dennis Elliott Shasha.

Informazioni su questo libro

Aimed at both working programmers who are applying for a job where puzzles are an integral part of the interview, as well as techies who just love a good puzzle, this book offers a cache of exciting puzzles Features a new series of puzzles, never before published, called elimination puzzles that have a pedagogical aim of helping the reader solve an entire class of Sudoku-like puzzles Provides the tools to solve the puzzles by hand and computer The first part of each chapter presents a puzzle; the second part shows readers how to solve several classes of puzzles algorithmically; the third part asks the reader to solve a mystery involving codes, puzzles, and geography Comes with a unique bonus: if readers actually solve the mystery, they have a chance to win a prize, which will be promoted on wrox.com!

Sull'Autore

è l'autore di Puzzles for programmers and pros. Esplora il suo catalogo completo su Booklogr.

Esplora altri libri di Dennis Elliott Shasha

Edizioni e Formati

Recensioni

Nessuna recensione ancora. Hai letto questo libro? Condividi le tue impressioni con la comunità di Booklogr.

Accedi Accedi per scrivere una recensione

Domande Frequenti

Di che genere è Puzzles for programmers and pros?+

Puzzles for programmers and pros è un libro di Puzzles, Mathematical recreations, Computer Technology, Non-Fiction.

Di cosa parla Puzzles for programmers and pros?+

Aimed at both working programmers who are applying for a job where puzzles are an integral part of the interview, as well as techies who just love a good puzzle, this book offers a cache of exciting puzzles Features a new series of puzzles, never before published, called elimination puzzles that ha...

Chi ha scritto Puzzles for programmers and pros?+

Puzzles for programmers and pros è stato scritto da Dennis Elliott Shasha.