Numbers and Computers


Book Description

This is a book about numbers and how those numbers are represented in and operated on by computers. It is crucial that developers understand this area because the numerical operations allowed by computers, and the limitations of those operations, especially in the area of floating point math, affect virtually everything people try to do with computers. This book aims to fill this gap by exploring, in sufficient but not overwhelming detail, just what it is that computers do with numbers. Divided into two parts, the first deals with standard representations of integers and floating point numbers, while the second examines several other number representations. Details are explained thoroughly, with clarity and specificity. Each chapter ends with a summary, recommendations, carefully selected references, and exercises to review the key points. Topics covered include interval arithmetic, fixed-point numbers, big integers and rational arithmetic. This new edition has three new chapters: Pitfalls of Floating-Point Numbers (and How to Avoid Them), Arbitrary Precision Floating Point, and Other Number Systems. This book is for anyone who develops software including software engineers, scientists, computer science students, engineering students and anyone who programs for fun.




Random Numbers and Computers


Book Description

This book covers pseudorandom number generation algorithms, evaluation techniques, and offers practical advice and code examples. Random Numbers and Computers is an essential introduction or refresher on pseudorandom numbers in computer science. The first comprehensive book on the topic, readers are provided with a practical introduction to the techniques of pseudorandom number generation, including how the algorithms work and how to test the output to decide if it is suitable for a particular purpose. Practical applications are demonstrated with hands-on presentation and descriptions that readers can apply directly to their own work. Examples are in C and Python and given with an emphasis on understanding the algorithms to the point of practical application. The examples are meant to be implemented, experimented with and improved/adapted by the reader.




The Data Handbook


Book Description

"What our teachers don't tell us in school is that we will spend most of our scientific or engineering career in front of computers, trying to beat them into submission." This extract from the Preface sets the style for this highly readable book. It is packed with information covering data representations, the pitfalls of computer arithmetic, and a variety of widely-used representations and standards. Each chapter begins with a detailed contents list and finishes with a brief summary of the topics presented and the whole is rounded off with a glossary and index. Novices will enjoy an occasionally lighthearted read from start to finish, while even the most experienced computer users who use the book as a reference will discover useful nuggets of information. A structured array of data sets are available online via the TELOS Web site, www.telospub.com, which will provide users with direct digital access to information they might need in working through the book.




Tracts for Computers


Book Description







Discrete Mathematics for Computer Science


Book Description

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms, number representations, logic, set theory, Boolean algebra, functions, combinatorics, algorithmic complexity, graphs, and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors, or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background, and to aid with the transition to abstract thinking Filled with over 200 worked examples, boxed for easy reference, and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school, he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics, specializing in Geometric Mechanics. Since 2012, he has worked at Zayed University in Dubai. This is his second mathematics textbook.




Finite Precision Number Systems and Arithmetic


Book Description

Fundamental arithmetic operations support virtually all of the engineering, scientific, and financial computations required for practical applications, from cryptography, to financial planning, to rocket science. This comprehensive reference provides researchers with the thorough understanding of number representations that is a necessary foundation for designing efficient arithmetic algorithms. Using the elementary foundations of radix number systems as a basis for arithmetic, the authors develop and compare alternative algorithms for the fundamental operations of addition, multiplication, division, and square root with precisely defined roundings. Various finite precision number systems are investigated, with the focus on comparative analysis of practically efficient algorithms for closed arithmetic operations over these systems. Each chapter begins with an introduction to its contents and ends with bibliographic notes and an extensive bibliography. The book may also be used for graduate teaching: problems and exercises are scattered throughout the text and a solutions manual is available for instructors.




Reflections on the History of Computers in Education


Book Description

This book is a collection of refereed invited papers on the history of computing in education from the 1970s to the mid-1990s presenting a social history of the introduction and early use of computers in schools. The 30 papers deal with the introduction of computer in schools in many countries around the world: Norway, South Africa, UK, Canada, Australia, USA, Finland, Chile, The Netherlands, New Zealand, Spain, Ireland, Israel and Poland. The authors are not professional historians but rather people who as teachers, students or researchers were involved in this history and they narrate their experiences from a personal perspective offering fascinating stories.




Edexcel GCSE Computer Science Student Book


Book Description

Publishing in September 2014, Edexcel GCSE Computer Science has been written by Steve Cushing, a well-respected and widely published author for secondary Computing and a former examiner. With Edexcel GCSE Computer Science: Students will have the assurance that all topics in the course are covered comprehensively, with particular support to help them understand the principles of computer science and computational thinking in preparation for the written exam Teachers and students can make use of strategies and advice throughout when choosing appropriate programming languages for both the written and practical units User-friendly and accessible practical examples will help to unpick theoretical topics




Use of Computers in Soviet Management


Book Description