9,”
`
`J
`
`SECOND EDITION
`
`7
`MICROSOFTAPRESSG)
`COMPUTER
`: DICTIONARY
` RRRRRRRND
`
`
`
`THE COMPREHENSIVE
`
`STANDARD FOR
`
`BUSINESS, SCHOOL,
`
`LIBRARY, AND HOME
`
`Microsoft
`P
`R
`E
`S
`S
`
`.
`
`ABB Inc.
`
`EXHIBIT 1050
`
`AMZ—RO03690'7
`
`. -
`
`-
`
`A
`
`-
`
`.
`
`--
`
`Page 1 of 9
`
`

`
`MICROSOFT PRESS®
`
`COMPUTER
`DICTIONARY
`
`SECOND
`
`EDITION
`
`.fl° .
`
`A
`
`A
`
`THE COMPREHENSIVE
`
`%
`
`STANDARD FOR
`BUSINESS, SCHOOL,
`
`
`
`LIBRARY, AND HOME
`
`
`
`Page 2 of 9
`
`Page 2 of 9
`
`

`
`PUBLISHED BY
`Microsoft Press
`
`A Division of Microsoft Corporation
`One Microsoft Way
`Redmond, Washington 980526399
`
`Copyright © 1994 by Microsoft Press
`
`All rights reserved. No part of the contents of this book may be reproduced or
`transmitted in any form or by any means without the written permission of the publisher.
`
`Library of Congress Cataloging-in—Puhlication Data
`
`the comprehensive standard for
`Microsoft Press computer dictionary :
`business, school, library, and home / Microsoft Press. -— 2nd ed.
`p.
`cm.
`ISBN 1«55615~597—2
`2. Microcomputers-—Dict.ionaries.
`1. Computers—Dictionaries.
`1. Microsoft Press.
`11. Title. Computer dictionary.
`QA7'6.15.M54
`1993
`0O4‘.O.’)- —dc20
`
`93-29868
`CIP
`
`Printed and bound in the United States of America.
`
`56789 MLML 98765
`
`Distributed to the book trade in Canada by Macmillan of Canada, a division of Canada
`Publishing Corporation.
`
`Distributed to the book trade outside the United States and Canada by
`Penguin Books Ltd.
`
`Penguin Books Ltd., Harrnondsworth, Middlesex, England
`Penguin Books Australia Ltd., Ringwood, Victoria, Australia
`Penguin Books N.Z. Ltd., 182-190 Wairau Road, Auckland 10, New Zealand
`
`British Cataloging—in—Publication Data available.
`
`Project Editor: Casey D. Doyle
`Manuscript Editor: Alice Copp Srnith
`Technical Editors: Mary Dejong, Jeff Carey, Dail Magee, jr.,Jim Fuchs, Seth McEvoy
`
`Page 3 of 9
`
`
`Page 3 of 9
`
`

`
`CONTRIBUTORS
`
`]oAnne Woodcock
`Senior Contributor
`
`Peter Aitken
`
`Charles Petzold
`
`Andrew Himes
`
`Phil Rose
`
`Chris Kinata
`William G. Madison
`
`David Rygrnyr
`Michael Vose
`
`Ross Nelson
`
`Bruce Webster
`
`Wallace Parker
`
`TECHNICAL REVIEWE RS
`
`Robert Ackerrnan
`
`Steve Bostwick
`
`Keith Burgoyne
`Kaare Christian
`
`James Johnson
`Chris Kinata
`
`Cary Lu
`M. David Stone
`
`Ray Duncan
`
`John Viescas
`
`Page 4 of 9
`
`Page 4 of 9
`
`

`
`CONTENTS
`
`Introduction
`
`Vii
`
`Dictionary of Computer Terms
`
`1
`
`Appendix A: ASCII Character Set
`
`425
`
`Appendix B:
`
`IBM Extended Character Set
`
`-427
`
`Appendix C: Apple Macintosh Extended Character Set
`
`428
`
`Appendix D: EBCDiC Character Set
`
`431
`
`Appendix E: Numeric Equivalents
`
`437
`
`Page 5 of 9
`
`
`Page 5 of 9
`
`

`
`INTRODUCTION
`
`The Microsoft Press CoinpiiterDiciiondryis designed to be a comprehensive and
`authoritative source of definitions for computer-related terms and abbreviations.
`Written and reviewed by a distinguished team of experts from the computer
`industry and the business and academic communities, the dictionary includes
`terms drawn from a wide variety of topics:
`
`Applications
`Communications
`Data and Data Storage
`Databases
`Desktop Publishing
`Electronics
`
`Hardware
`
`Chips, Cards, and Boards
`Computers
`Disks, Drives, and Other Media
`Keyboards
`Printers and Plotters
`Video
`Other Devices
`
`History
`Information Processing
`General Computing
`Input/Qutput
`Memory and Memory Management
`Networks
`
`Output
`
`Print
`Screen
`Programming
`Systems and Environments
`
`it does not
`Although the book covers nearly every aspect of computing,
`include entries on specific companies or on most makes and models of com-
`puters, nor does it contain entries on most application software products,
`although some key products of universal importance are covered.
`
`Order of Presentation
`
`Entries are alphabetized letter by letter. Spaces are ignored, as are characters such
`as hyphens and slashes; for example, Bdiidoi code falls between bdud and baud
`rate, and mdcbine—independent falls between machine identification and
`machine instruction. Numbers and symbols are located at the beginning of the
`book and are listed in ascending ASCII order. If an entry begins with a letter or
`letters but contains a number, it is listed alphabetically, according to the initial
`1etter(s), and then according to ASCII order. Thus, V20 precedes I/.2x, and both
`precede WIB.
`
`Page 6 -of 9
`
`
`vii
`
`Page 6 of 9
`
`

`
`
`
`Format
`
`Information in each entry is presented in a consistent format: entry name,
`abbreviation, pronunciation (if supplied), alternative name or names, definition,
`and cross—references (if any).
`Phonetic pronunciations are given where appropriate or in cases where pro-
`nunciation might not be apparent. If an abbreviation is pronounced simply by
`saying the successive letters it contains, no pronunciation is given.
`Cross—references are of three kinds: A See reference simply points to another
`entry that contains the information sought; a See also reference points to one or
`more entries that contain additional or supplemental information about the topic;
`and a Compare reference points to an entry or entries that offer contrast.
`Illustrations are called out in the text. In most cases, illustrations appear on the
`same page as the entries to which they apply. In some instances, however, page
`layout requirements have forced them to a subsequent page. In any event, the
`caption of each illustration identifies the entry to which it belongs.
`
`Future Printings and Editions
`
`Every effort has been made to ensure the accuracy and completeness of this book.
`If you find an error, think that an entry does not contain enough information, or
`seek an entry that does not appear in this edition, please let us know. Address your
`letter to: Dictionary Editor, Microsoft Press, Dept. 302, One Microsoft Way,
`Redmond, WA 98052-8502.
`
`
`
`M
`
`Page 7 of 9
`
`Page 7 of 9
`
`

`
` dynarnic—link library
`dye-polymer recording
`
`term is usually limited to describing a system
`with two microprocessors; a system with a micro-
`processor and a math coprocessor is not consid-
`ered a dyadic system.
`In mathematics, at dyadic
`operation is one in which there are two oper-
`ands. In Boolean algebra, a dyadic Boolean op-
`eration is, again, one in which there are two
`operands, both of which are significant. Dyadic
`Boolean operations are those such as AND and
`OR in which the outcome depends on both val-
`ues. Such operations are commonly used to cre-
`ate truth tables. Compare unary; see also Boolean
`algebra, operand.
`recording
`dye-polymer recording A type of
`technology used with optical discs in which dye
`embedded in a plastic polymer coating on an op-
`tical disc is used to create minute bumps on the
`surface that can be read by a laser. Dye-polymer
`bumps can be flattened and re-created, thus mak-
`ing an optical disc rewritable, as opposed to be-
`ing recordable only once.
`dynamic An adjective used to describe events or
`processes that occur immediately and concur-
`rently as opposed to those planned for in ad-
`vance or reacted to after the fact. Dynczmzc is
`used in reference to both hardware and software;
`in each case it describes some action or event
`
`that occurs when and as needed. In nondynamic
`memory management, a program is given a cer-
`tain amount of memory when the program is first
`run and must run within that constraint. In dy-
`namic memory management, a program is able to
`negotiate with the operating system when it
`needs more memory.
`dynamic address translation Abbreviated DAT.
`On-the-fly conversion of memory-location refer-
`ences from relative addresses (“three units from
`
`needs. Dynamic allocation almost always implies
`that dynamic deallocation is possible too, so data
`structures can be created and destroyed as re-
`quired. Compare static allocation; see also allo-
`cate, deallocate.
`dynamic binding Also called late binding. Bind-
`ing (converting symbolic addresses in the pro-
`gram to storage-related addresses) that occurs
`during program execution. The term often refers
`to object—oriented applications that determine,
`during runtime, which software routines to call
`for particular data objects. For example, an appli-
`cation might define a class named “artwork,” with
`subclasses for paintings, sculptures, ceramics,
`and so on. Each of these classes would have a
`routine named “dollarvaluenow” that would cal-
`culate the current value of a piece of art, based in
`part on the class's unique characteristics and also
`on the state of the market for art. Given an art-
`
`work object, dynamic binding would ensure that
`the correct “dollarvaluenow” routine was called
`
`to compute the current value. Compare static
`binding.
`Dynamic Data Exchange Abbreviated DDE. A
`form of interprocess communication (IPC) imple-
`mented in Microsoft Windows and OS/2. When
`
`two or more programs that support DDE are run-
`ning simultaneously, they can exchange informa-
`tion and commands. For example, a spreadsheet
`with a DDE link to a communications program
`might be capable of keeping stock prices that are
`displayed in the spreadsheet current with trading
`information received over the communications
`
`the beginning of X”) to absolute address (“location
`number 125”) when a program isrun. Dynamic
`address translation depends on conditions exist-
`ing within the system at the runtime of a pro-
`gram; for example,
`it might depend on exactly
`where in memory a particular part of a program is
`loaded by the operating system.
`dynamic allocation The allocation of memory
`during program execution according to current
`
`
`channel. See also interprocess communication.
`dynamic dump A listing, either stored on disk or
`sent to a printer, of memory contents generated
`at the time of a break in the execution of a pro-
`gram; a useful tool for programmers interested in
`knowing what is happening at a certain point in
`the execution of a program.
`dynamic-link library A feature of the Microsoft
`Windows family of‘ operating systems and the
`OS/2 operating system that allows executable
`routines—generally serving a specific function or
`set of functions——to be stored separately as files
`with DLL extensions and to be loaded only when
`
` _
`
`157
`
`Page 8 of 9
`
`Page 8 of 9
`
`

`
`dynamic RAM
`
` dynamic storage
`
`needed by the program that calls them. A dynamic-
`link library has several advantages. First, because
`a dynamic-link library is loaded only when it is
`needed, it does not consume any memory until it
`is used. Second, because a dynamic-link library is
`a separate file, a programmer can make correc-
`tions or improvements to only that module with-
`out affecting the operation of the calling program
`or any other dynamic-link library. Finally, be-
`cause a dynamic-link library often contains re-
`lated functions——for
`example,
`routines
`for
`creating animation on a video display-—a pro-
`grammer can use the same dynamic~linl< library
`with other programs.
`dynamic RAM Abbreviated DRAM (pronounced
`“dee-ram”). A form of semiconductor random ac-
`cess memory (RAM). Dynamic RAMS store infor-
`mation
`in
`integrated
`circuits
`that
`contain
`capacitors. Because capacitors lose their charge
`over time, dynamic RAM boards must
`include
`logic to “refresh" (recharge) the RAM chips con-
`tinuously. While a dynamic RAM is being re-
`freshed, it cannot be read by the processor; if the
`processor must read the RAM while it is being re-
`freshed, one or more wait states occur. Because
`
`their internal circuitry is simple, dynamic RAMs
`are more commonly used than static RAMS, even
`though they are slower. A dynamic RAM can hold
`approximately four times as much data as a static
`RAM chip of the same complexity. Compare static
`RAM; see also RAM.
`dynamic relocation The relocation in memory
`of data or of the code of a currently running pro-
`gram by an internal system routine. Dynamic re-
`location helps a computer use memory efficiently.
`dynamic scheduling The management of con-
`currently running processes (programs), usually
`by the operating system.
`dynamic storage A term describing information
`storage systems Whose contents will be lost if
`power is removed from the system. RAM (ran-
`dom access memory) systems are the most com-
`mon form of dynamic storage, and both dynamic
`RAM (DRAM) and static RAM (SRAM) are consid-
`ered forms of dynamic storage. Compare perma-
`nent storage; see also dynamic RAM, static RAM.
`In programming, a term describing blocks of
`memory that can be allocated, deallocated, or
`freely changed in size.
`
`Page 9 of 9
`
`
`158
`
`Page 9 of 9