The Big Book of Small Python Projects
The Big Book of Small Python Projects

Author: Al Sweigart

Publisher: No Starch Press

Published: 2021-06-25

Total Pages: 433

ISBN-13: 1718501242

DOWNLOAD EBOOK

Best-selling author Al Sweigart shows you how to easily build over 80 fun programs with minimal code and maximum creativity. If you’ve mastered basic Python syntax and you’re ready to start writing programs, you’ll find The Big Book of Small Python Projects both enlightening and fun. This collection of 81 Python projects will have you making digital art, games, animations, counting pro- grams, and more right away. Once you see how the code works, you’ll practice re-creating the programs and experiment by adding your own custom touches. These simple, text-based programs are 256 lines of code or less. And whether it’s a vintage screensaver, a snail-racing game, a clickbait headline generator, or animated strands of DNA, each project is designed to be self-contained so you can easily share it online. You’ll create: • Hangman, Blackjack, and other games to play against your friends or the computer • Simulations of a forest fire, a million dice rolls, and a Japanese abacus • Animations like a virtual fish tank, a rotating cube, and a bouncing DVD logo screensaver • A first-person 3D maze game • Encryption programs that use ciphers like ROT13 and Vigenère to conceal text If you’re tired of standard step-by-step tutorials, you’ll love the learn-by-doing approach of The Big Book of Small Python Projects. It’s proof that good things come in small programs!

The Art and Craft of Problem Solving
The Art and Craft of Problem Solving

Author: Paul Zeitz

Publisher: John Wiley & Sons

Published: 2017

Total Pages: 389

ISBN-13: 1119239907

DOWNLOAD EBOOK

This text on mathematical problem solving provides a comprehensive outline of "problemsolving-ology," concentrating on strategy and tactics. It discusses a number of standard mathematical subjects such as combinatorics and calculus from a problem solver's perspective.

The Virgin Book of Killer Sudoku
The Virgin Book of Killer Sudoku

Author: Virgin Books

Publisher: Random House

Published: 2006

Total Pages: 146

ISBN-13: 0753511584

DOWNLOAD EBOOK

If you thought Sudoku was difficult, wait until you try Killer Sudoku! The next step up from normal Sudoku, the Killer puzzles use the same grid as Sudoku and require the reader to fill in the numbers 1 to 9 as before. But this time the numbers in the outlined boxes must also all add up to a specific number. Already hugely popular in the national press, the puzzles are a must for Sudoku fans. With five difficulty ratings, from 'very easy' to 'deadly', the 100 brand new Killer Sudoku puzzles in this book will provide a challenge to the most ardent Sudoku addict.

The Algorithm Design Manual
The Algorithm Design Manual

Author: Steven S Skiena

Publisher: Springer Science & Business Media

Published: 2009-04-05

Total Pages: 742

ISBN-13: 1848000707

DOWNLOAD EBOOK

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography. NEW to the second edition: • Doubles the tutorial material and exercises over the first edition • Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video • Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them • Includes several NEW "war stories" relating experiences from real-world applications • Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Sage for Undergraduates
Sage for Undergraduates

Author: Gregory V. Bard

Publisher: American Mathematical Soc.

Published: 2015-02-16

Total Pages: 378

ISBN-13: 1470411113

DOWNLOAD EBOOK

As the open-source and free competitor to expensive software like MapleTM, Mathematica®, Magma, and MATLAB®, Sage offers anyone with access to a web browser the ability to use cutting-edge mathematical software and display his or her results for others, often with stunning graphics. This book is a gentle introduction to Sage for undergraduate students toward the end of Calculus II (single-variable integral calculus) or higher-level course work such as Multivariate Calculus, Differential Equations, Linear Algebra, or Math Modeling. The book assumes no background in computer science, but the reader who finishes the book will have learned about half of a first semester Computer Science I course, including large parts of the Python programming language. The audience of the book is not only math majors, but also physics, engineering, finance, statistics, chemistry, and computer science majors.

Word Searches For Dummies
Word Searches For Dummies

Author: Denise Sutherland

Publisher: John Wiley & Sons

Published: 2009-05-11

Total Pages: 436

ISBN-13: 0470453664

DOWNLOAD EBOOK

A travel-friendly puzzle-packed book that keeps the brain in shape One of the best ways to exercise the mind is through word and logic games like word searches and Sudoku. Studies have shown that doing word searches frequently can help prevent diseases like Alzheimer's and dementia. Word Searches For Dummies is a great way to strengthen the mind and keep the brain active plus, it's just plain fun! This unique guide features several different types of word searches that take readers beyond simply circling the answer: secret shape word searches, story word searches, listless word searches, winding words, quiz word searches, and more. It provides a large number of puzzles at different levels that will both test and exercise the mind while keeping the reader entertained for hours.

The Book of Number Searches
The Book of Number Searches

Author: Djape

Publisher: Createspace Independent Publishing Platform

Published: 2015-11-18

Total Pages: 502

ISBN-13: 9781519375285

DOWNLOAD EBOOK

Welcome to this huge collection of Number Searches, with 1000 puzzles! The rules of Number Search puzzles are simple: find the listed numbers in the grid. They can be laid out in any of the 8 directions: horizontal, vertical, left diagonal, right diagonal and all those backwards, too! Thousands and thousands of numbers for you to find! Printed in large font, very easy to read the numbers! ENJOY! :) _______________________________________ number search, number searches, number search book, number searches book, number sleuth, number find, large print number search, number search large print, large font number search, number search large font, big print number search, number search big print, big font number search, number search big font, large print number search book, number search book large print, large font number search book, number search book large font, big print number search book, number search book big print, big font number search book, number search book big font, number sleuth book, number find book, find a number, find a number book, numbers in a grid

Algorithmic Puzzles
Algorithmic Puzzles

Author: Anany Levitin

Publisher: OUP USA

Published: 2011-10-14

Total Pages: 280

ISBN-13: 0199740445

DOWNLOAD EBOOK

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.

Latin Squares and Their Applications
Latin Squares and Their Applications

Author: A. Donald Keedwell

Publisher: Elsevier

Published: 2015-07-28

Total Pages: 443

ISBN-13: 0444635580

DOWNLOAD EBOOK

Latin Squares and Their Applications, Second edition offers a long-awaited update and reissue of this seminal account of the subject. The revision retains foundational, original material from the frequently-cited 1974 volume but is completely updated throughout. As with the earlier version, the author hopes to take the reader 'from the beginnings of the subject to the frontiers of research'. By omitting a few topics which are no longer of current interest, the book expands upon active and emerging areas. Also, the present state of knowledge regarding the 73 then-unsolved problems given at the end of the first edition is discussed and commented upon. In addition, a number of new unsolved problems are proposed. Using an engaging narrative style, this book provides thorough coverage of most parts of the subject, one of the oldest of all discrete mathematical structures and still one of the most relevant. However, in consequence of the huge expansion of the subject in the past 40 years, some topics have had to be omitted in order to keep the book of a reasonable length. Latin squares, or sets of mutually orthogonal latin squares (MOLS), encode the incidence structure of finite geometries; they prescribe the order in which to apply the different treatments in designing an experiment in order to permit effective statistical analysis of the results; they produce optimal density error-correcting codes; they encapsulate the structure of finite groups and of more general algebraic objects known as quasigroups. As regards more recreational aspects of the subject, latin squares provide the most effective and efficient designs for many kinds of games tournaments and they are the templates for Sudoku puzzles. Also, they provide a number of ways of constructing magic squares, both simple magic squares and also ones with additional properties. - Retains the organization and updated foundational material from the original edition - Explores current and emerging research topics - Includes the original 73 'Unsolved Problems' with the current state of knowledge regarding them, as well as new Unsolved Problems for further study

Introductory Combinatorics
Introductory Combinatorics

Author: Kenneth P. Bogart

Publisher: Harcourt Brace College Publishers

Published: 1990

Total Pages: 648

ISBN-13:

DOWNLOAD EBOOK

Introductory, Combinatorics, Third Edition is designed for introductory courses in combinatorics, or more generally, discrete mathematics. The author, Kenneth Bogart, has chosen core material of value to students in a wide variety of disciplines: mathematics, computer science, statistics, operations research, physical sciences, and behavioral sciences. The rapid growth in the breadth and depth of the field of combinatorics in the last several decades, first in graph theory and designs and more recently in enumeration and ordered sets, has led to a recognition of combinatorics as a field with which the aspiring mathematician should become familiar. This long-overdue new edition of a popular set presents a broad comprehensive survey of modern combinatorics which is important to the various scientific fields of study.