The absolute beginner's guide to learning basic computer skills Computing Fundamentals, Introduction to Computers gets you up to speed on basic computing skills, showing you everything you need to know to conquer entry-level computing courses. Written by a Microsoft Office Master Instructor, this useful guide walks you step-by-step through the most important concepts and skills you need to be proficient on the computer, using nontechnical, easy-to-understand language. You'll start at the very beginning, getting acquainted with the actual, physical machine, then progress through the most common software at your own pace. You'll learn how to navigate Windows 8.1, how to access and get around on the Internet, and how to stay connected with email. Clear instruction guides you through Microsoft Office 2013, helping you create documents in Word, spreadsheets in Excel, and presentations in PowerPoint. You'll even learn how to keep your information secure with special guidance on security and privacy. Maybe you're preparing for a compulsory computing course, brushing up for a new job, or just curious about how a computer can make your life easier. If you're an absolute beginner, this is your complete guide to learning the essential skills you need: Understand the basics of how your computer works Learn your way around Windows 8.1 Create documents, spreadsheets, and presentations Send email, surf the Web, and keep your data secure With clear explanations and step-by-step instruction, Computing Fundamentals, Introduction to Computers will have you up and running in no time.

This hands-on tutorial is a broad examination of how a modern computer works. Classroom tested for over a decade, it gives readers a firm understanding of how computers do what they do, covering essentials like data storage, logic gates and transistors, data types, the CPU, assembly, and machine code. Introduction to Computer Organization gives programmers a practical understanding of what happens in a computer when you execute your code. You may never have to write x86-64 assembly language or design hardware yourself, but knowing how the hardware and software works will give you greater control and confidence over your coding decisions. We start with high level fundamental concepts like memory organization, binary logic, and data types and then explore how they are implemented at the assembly language level. The goal isn’t to make you an assembly programmer, but to help you comprehend what happens behind the scenes between running your program and seeing “Hello World” displayed on the screen. Classroom-tested for over a decade, this book will demystify topics like: How to translate a high-level language code into assembly language How the operating system manages hardware resources with exceptions and interrupts How data is encoded in memory How hardware switches handle decimal data How program code gets transformed into machine code the computer understands How pieces of hardware like the CPU, input/output, and memory interact to make the entire system work Author Robert Plantz takes a practical approach to the material, providing examples and exercises on every page, without sacrificing technical details. Learning how to think like a computer will help you write better programs, in any language, even if you never look at another line of assembly code again.

David Harel explains and illustrates one of the most fundamental, yet under-exposed facets of computers - their inherent limitations.

Peter Norton is a pioneering software developer and author. Norton's desktop for windows, utilities, backup, antivirus, and other utility programs are installed on millions of PCs worldwide. His inside the IBM PC and DOS guide have helped millions of people understand computers from the inside out. Peter Norton's introduction to computers incorporates features not found in other introductory programs. Among these are the following: Focus on the business-computing environment for the 1990s and beyond, avoiding the standard 'MIS approach.': A 'glass-box' rather than the typical 'black-box' view of computers-encouraging students to explore the computer from the inside out.

Special Purpose Computers describes special-purpose computers and compares them to general-purpose computers in terms of speed and cost. Examples of computers that were designed for the efficient solution of long established algorithms are given, including Navier-Stokes hydrodynamic solvers, classical molecular dynamic machines, and Ising model computers. Comprised of seven chapters, this volume begins by documenting the progress of the CalTech Concurrent Computation Program and its evolution from computational high-energy physics to a supercomputer initiative, with emphasis on the lessons learned including computer architecture issues and the trade-offs between in-house and commercial development. The reader is then introduced to the QCD Machine, a special-purpose parallel supercomputer that was designed and built to solve the lattice quantum chromodynamics problem. Subsequent chapters focus on the Geometry-Defining Processors and their application to the solution of partial differential equations; the Navier-Stokes computer; parallel processing using the Loosely Coupled Array of Processors (LCAP) system; and the Delft Ising system processor. The design and implementation of the Delft molecular-dynamics processor are also described. This book will be of interest to computer engineers and designers.

Introduction to Computing is a comprehensive text designed for the CS0 (Intro to CS) course at the college level. It may also be used as a primary text for the Advanced Placement Computer Science course at the high school level.

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo rithmic complexity theory. The theory of Martin-Lof tests for random ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book. We also investigate the recursion theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).

Written by high performance computing (HPC) experts, Introduction to High Performance Computing for Scientists and Engineers provides a solid introduction to current mainstream computer architecture, dominant parallel programming models, and useful optimization strategies for scientific HPC. From working in a scientific computing center, the author

A gentle, friendly guide to using a PC with Windows XP. An excellent computer primer for beginners, but also appropriate for intermediate users wanting to get more out of their PC. The book leads readers through the world of PC hardware, Windows XP, the Internet, and application software.

Now you can clearly present even the most complex computational theory topics to your students with Sipser’s distinct, market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today’s computational theory course, this highly anticipated revision retains the unmatched clarity and thorough coverage that make it a leading text for upper-level undergraduate and introductory graduate students. This edition continues author Michael Sipser’s well-known, approachable style with timely revisions, additional exercises, and more memorable examples in key areas. A new first-of-its-kind theoretical treatment of deterministic context-free languages is ideal for a better understanding of parsing and LR(k) grammars. This edition’s refined presentation ensures a trusted accuracy and clarity that make the challenging study of computational theory accessible and intuitive to students while maintaining the subject’s rigor and formalism. Readers gain a solid understanding of the fundamental mathematical properties of computer hardware, software, and applications with a blend of practical and philosophical coverage and mathematical treatments, including advanced theorems and proofs. INTRODUCTION TO THE THEORY OF COMPUTATION, 3E’s comprehensive coverage makes this an ideal ongoing reference tool for those studying theoretical computing. Important Notice: Media content referenced within the product description or the product text may not be available in the ebook version.