Aiming to tell the dark secrets of computer arithmetic, this title is suitable for library developers, compiler writers, and lovers of elegant hacks.

    Engineering professor Barbara Oakley knows firsthand how it feels to struggle with math. She flunked her way through high school math and science courses, before enlisting in the army immediately after graduation. When she saw how her lack of mathematical and technical savvy severely limited her options—both to rise in the military and to explore other careers—she returned to school with a newfound determination to re-tool her brain to master the very subjects that had given her so much trouble throughout her entire life. In A Mind for Numbers, Dr. Oakley lets us in on the secrets to effectively learning math and science—secrets that even dedicated and successful students wish they’d known earlier. Contrary to popular belief, math requires creative, as well as analytical, thinking. Most people think that there’s only one way to do a problem, when in actuality, there are often a number of different solutions—you just need the creativity to see them. For example, there are more than three hundred different known proofs of the Pythagorean Theorem. In short, studying a problem in a laser-focused way until you reach a solution is not an effective way to learn math. Rather, it involves taking the time to step away from a problem and allow the more relaxed and creative part of the brain to take over. A Mind for Numbers shows us that we all have what it takes to excel in math, and learning it is not as painful as some might think!

    Polya, How to Solve It will show anyone in any field how to think straight. In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be reasoned out--from building a bridge to winning a game of anagrams. Generations of readers have relished Polya's deft--indeed, brilliant--instructions on stripping away irrelevancies and going straight to the heart of the problem.

    This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

    If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge

    It also touches upon the fundamentals of 32 bit, and 64 bit advanced processors. The book throughout provides the most popular programming tool - the assembly language codes to enhance the knowledge of programming the processors.Clear and concise in its treatment of topics, the contents of the book is supported by learning tools such as review questions, application examples (case studies) and design-based exercises.

    With a new introduction, three new chapters, modernized language and methods throughout, and an appendix of challenging and enjoyable practice problems, Calculus Made Easy has been thoroughly updated for the modern reader.

    You can think of Python as your tool to solve problems that are far beyond the capability of a spreadsheet. It is an easy-to-use and easy-to learn programming language that is freely available on Windows, Macintosh, and Linux computers. There are free downloadable copies of this book in various electronic formats and a self-paced free online course where you can explore the course materials. All the supporting materials for the book are available under open and remixable licenses. This book is designed to teach people to program even if they have no prior experience.

    CONTAINS MCQ'S

    The salient features of the book are as follows: It exactly covers the prescribed syllabus. Nothing undesirable has been included and nothing essential has been left. Its approach is explanatory and language is lucid and communicable. The exposition of the subject matter is systematic and the students are better prepared to solve the problems. All fundamentals of the included topics are explained with a micro-analysis. Sufficient number of solved examples have been given to let the students understand the various skills necessary to solve the problems. These examples are well-graded. Unsolved exercises of multi-varieties have been given in a well-graded style. Attempting those on his own, will enable a student to create confidence and independence in him/her regarding the understanding of the subject. Daily life problems and practical applications have been incorporated in the body of the text. A large number of attractive and accurate figures have been drawn which enable a student to grasp the subject in an easier way. All the answers have been checked and verified. About The Author: N.P. Bali is a prolific author of over 100 books for degree and engineering students. He has been writing books for more than forty years. His books on the following topics are well known for their easy comprehension and lucid presentation: Algebra, Trigonometry, Differential Calculus, Integral Calculus, Real Analysis, Co-ordinate Geometry, Statics, Dynamics etc. Dr. Manish Goyal has been associated with

    The study of type systems--and of programming languages from a type-theoretic perspective--has important applications in software engineering, language design, high-performance compilers, and security.This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material.The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.

    There is joy and beauty in mathematics, and in more than two dozen essays drawn from his popular “Good Math” blog, you’ll find concepts, proofs, and examples that are often surprising, counterintuitive, or just plain weird.Mark begins his journey with the basics of numbers, with an entertaining trip through the integers and the natural, rational, irrational, and transcendental numbers. The voyage continues with a look at some of the oddest numbers in mathematics, including zero, the golden ratio, imaginary numbers, Roman numerals, and Egyptian and continuing fractions. After a deep dive into modern logic, including an introduction to linear logic and the logic-savvy Prolog language, the trip concludes with a tour of modern set theory and the advances and paradoxes of modern mechanical computing.If your high school or college math courses left you grasping for the inner meaning behind the numbers, Mark’s book will both entertain and enlighten you.

    Several things make this one stand out. Here's the most important: Linux Administration Handbook is designed for administrators working in industrial-strength production environments. It never glosses over the "subtleties" that can get you in big trouble. It doesn't stint on technical detail. It's never satisfied with restating the man pages. And it's full of war stories from folks who've been there. Evi Nemeth and her coauthors: Boy, have they ever been there. (Just ask any gray-bearded Unix sysadmin about their earlier, legendary Unix System Administration Handbook.) There's only been one downside to Linux Administration Handbook: It's been nearly five years since it was written. Well, that flaw's just been remedied. The new Second Edition has been systematically revised for the latest administration tools (think Nagios and LVM). It's carefully targeted at today's five most widely used distributions: Red Hat Enterprise Linux 4.3, Fedora Core 5, SUSE Linux 10.2, Debian 3.2 "Etch," and Ubuntu 6.06. The result: a book you can rely on for the next five years. Rely on to do what? Just about everything. You'll find chapters on booting and shutting down; "rootly" powers; controlling processes; the Linux filesystem; on adding new users. You'll learn the most efficient ways to perform backups. How to make sense of syslogs and log files. Everything you need to know about drivers, the kernel, networking, NFS -- and Internet services, from web hosting to email. Nemeth & Company bring their experience to bear on troubleshooting, performance optimization, print management, security, Windows interoperability, even "policies and politics." Whatever Linux books you already own, if you depend on Linux to run efficiently and reliably, you need this one, too. Bill Camarda, from the December 2006 href="http://www.barnesandnoble.com/newslet... Only

    Using science, math, innovation, and improvisation, Bletchley Park code breakers worked furiously to invent a machine to decipher what turned out to be the secrets of Nazi high command. It was called Colossus. What these code breakers didn't realize was that they had fashioned the world's first true computer. When the war ended, this incredible invention was dismantled and hidden away for almost 50 years. Paul Gannon has pieced together the tremendous story of what is now recognized as the greatest secret of Bletchley Park.

    In studying number theory from such a perspective, mathematics majors are spared repetition and provided with new insights, while other students benefit from the consequent simplicity of the proofs for many theorems.Among the topics covered in this accessible, carefully designed introduction are multiplicativity-divisibility, including the fundamental theorem of arithmetic, combinatorial and computational number theory, congruences, arithmetic functions, primitive roots and prime numbers. Later chapters offer lucid treatments of quadratic congruences, additivity (including partition theory) and geometric number theory.Of particular importance in this text is the author's emphasis on the value of numerical examples in number theory and the role of computers in obtaining such examples. Exercises provide opportunities for constructing numerical tables with or without a computer. Students can then derive conjectures from such numerical tables, after which relevant theorems will seem natural and well-motivated..